Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-10T15:53:59.794Z Has data issue: false hasContentIssue false
  • English
  • Français

Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach

Published online by Cambridge University Press:  28 May 2015

Xi Chen ,
Wai-Ki Ching ,
Xiao-Shan Chen ,
Yang Cong  and
Nam-Kiu Tsing
Xi Chen*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Wai-Ki Ching*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Xiao-Shan Chen*
Affiliation:
School of Mathematical Sciences, South China Normal University, Guangzhou, China
Yang Cong*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Nam-Kiu Tsing*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
*
Corresponding author. Email: dlkcissy@hotmail.com
Corresponding author. Email: wching@hkusua.hku.hk
Corresponding author. Email: cxs333@21cn.com
Corresponding author. Email: congyang0305@yahoo.com.cn
Corresponding author. Email: nktsing@hku.hk
Get access

Abstract

Modeling genetic regulatory networks is an important problem in genomic research. Boolean Networks (BNs) and their extensions Probabilistic Boolean Networks (PBNs) have been proposed for modeling genetic regulatory interactions. In a PBN, its steady-state distribution gives very important information about the long-run behavior of the whole network. However, one is also interested in system synthesis which requires the construction of networks. The inverse problem is ill-posed and challenging, as there may be many networks or no network having the given properties, and the size of the problem is huge. The construction of PBNs from a given transition-probability matrix and a given set of BNs is an inverse problem of huge size. We propose a maximum entropy approach for the above problem. Newton's method in conjunction with the Conjugate Gradient (CG) method is then applied to solving the inverse problem. We investigate the convergence rate of the proposed method. Numerical examples are also given to demonstrate the effectiveness of our proposed method.

Keywords

Boolean networksconjugate gradient methodgenetic regulatory networksinverse problemMarkov chainsNewton's methodprobabilistic Boolean networkstransition-probability matrix
Type
Research Article
Information
East Asian Journal on Applied Mathematics , Volume 1 , Issue 2 , May 2011 , pp. 132 - 154
Copyright
Copyright © Global-Science Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Akutsu, T., Hayasida, M., Ching, W. and Ng, M., (2007), Control of Boolean Networks: Hardness Results and Algorithms for Tree Structured Networks, Journal of Theoretical Biology, (244), 670–679.Google Scholar
[2]Aldana, M., (2003), Boolean Dynamics of Networks with Scale-free Topology, Physica D (185), 45–66.Google Scholar
[3]Axelsson, O., (1996), Iterative Solution Methods, Cambridge University Press, Cambridge, UK.Google Scholar
[4]Boole, G., (1847), Mathematical Analysis of Logic, Being an Essay Towards a Calculus of Deductive Reasoning, Reprint: Blackwell, Oxford, 1948.Google Scholar
[5]Boole, G., (1854), An Investigation of the Laws of Thought, on Which are Founded the Mathematical Theories of Logic and Probabilities, Reprint: Dover Publications, New York, 1958.Google Scholar
[6]Brun, M., Dougherty, E. and Shmulevich, I., (2005), Steady-State Probabilities for Attractors in Probabilistic Boolean Networks, Signal Processing, 85 (4), 1993–2013.Google Scholar
[7]Celis, J. E., Kruhøfferm, M., Gromova, I., Frederiksen, C., Østergaard, M. and Ørntoft, T. F., (2000), Gene Expression Profiling: Monitoring Transcription and Translation Products Using DNA Microarrays and Proteomics, FEBS Lett. 480 (1), 2–16.Google Scholar
[8]Ching, W., Scholtes, S. and Zhang, S., (2004), Numerical Algorithms for Estimating Traffic Between Zones in a Network, Engineering Optimisation, (36), 379–400.Google Scholar
[9]Ching, W., Fung, E., Ng, M. and Akutsu, T., (2005), On Construction of Stochastic Genetic Networks Based on Gene Expression Sequences, International Journal of Neural Systems, (15), 297–310.Google Scholar
[10]Ching, W. and Ng, M., (2006), Markov Chains: Models, Algorithms and Applications, International Series on Operations Research and Management Science, Springer: New York.Google Scholar
[11]Ching, W., Zhang, S., Ng, M. and Akutsu, T., (2007), An Approximation Method for Solving the Steady-state Probability Distribution of Probabilistic Boolean Networks, Bioinformatics, (23), 1511–1518.Google Scholar
[12]Ching, W., Zhang, S., Jiao, Y., Akutsu, T. and Wong, A., (2009), Optimal Control Policy for Probabilistic Boolean Networks with Hard Constraints. IET on Systems Biology, (3), 90–99.Google Scholar
[13]Ching, W. and Cong, Y., (2009), A New Optimization Model for the Construction of Markov Chains, CSO2009, Hainan, IEEE Computer Society Proceedings, 551–555.Google Scholar
[14]Conn, A., Gould, B. and Toint, P., (2000), Trust-region Methods, SIAM Publications, Philadelphia.Google Scholar
[15]Datta, A., Choudhary, A., Bitter, M. and Dougherty, E. R., (2003), External Control in Markovian Genetic Regulatory Networks, Machine Learning, (52), 169–191.Google Scholar
[16]de Jong, H., (2002), Modeling and Simulation of Genetic Regulatory Systems: A Literature Review, Journal of Computational Biology, (9), 69–103.Google Scholar
[17]Dennis, J. and Schnabel, R., (1983), Numerical Methods for Unconstrained Optimisation and Nonlinear Equations, Prentice Hall, Englewood Cliffs.Google Scholar
[18]Dougherty, E., Kim, S. and Chen, Y., (2000), Coefficient of Determination in Nonlinear Signal Processing, Signal Processing, (80), 2219–2235.Google Scholar
[19]Huang, S. and Ingber, D. E., (2000), Shape-dependent Control of Cell Growth, Differentiation, and Apoptosis: Switching Between Attractors in Cell Regulatory Networks, Experimental Cell Research, (261), 91–103.Google Scholar
[20]Horn, R. and Johnson, C., (1985), Matrix Analysis, Cambridge University Press, Cambridge.Google Scholar
[21]Kauffman, S., (1969), Metabolic Stability and Epigenesis in Randomly Constructed Gene Nets, Journal of Theoretical Biology, (22), 437–467.Google Scholar
[22]Kauffman, S., (1969), Homeostasis and Differentiation in Random Genetic Control Networks, Nature, (224), 177–178.Google Scholar
[23]Kauffman, S., (1974), The Large Scale Structure and Dynamics of Genetic Control Circuits: An Ensemble Approach, Journal of Theoretical Biology, (44), 167–190.Google Scholar
[24]Kauffman, S., (1993), The Origins of Order: Self-organization and Selection in Evolution, New York: Oxford University Press.Google Scholar
[25]Kim, S., Imoto, S. and Miyano, S., (2003), Dynamic Bayesian Network and Nonparametric Regression for Nonlinear Modeling of Gene Networks from time Series Gene Expression Data, Proc. 1st Computational Methods in Systems Biology, Lecture Note in Computer Science, (2602), 104–113.CrossRefGoogle Scholar
[26]Huang, S., (1999), Gene Expression Profiling, Genetic Networks and Cellular States: An Integrating Concept for Tumorigenesis and Drug Discovery, Journal of Molecular Medicine, (77), 469–480.Google Scholar
[27]Mortveit, H. and Reidys, M., (2007), An Introduction to Sequential Dynamical Systems, Springer Verlag, New York.Google Scholar
[28]Nocedal, J. and Wright, S., (1999), Numerical Optimisation, Springer-Verlag, New York.Google Scholar
[29]Pal, R., Ivanov, I., Datta, A., Bittner, M. and Dougherty, E., (2005), Generating Boolean Networks with a Prescribed Attractor Structure, Bioinformatics, (21), 4021–4025.Google Scholar
[30]Pal, R., Datta, A., Bittner, M. and Dougherty, E., (2005), Intervention in Context-sensitive Probabilistic Boolean Networks, Bioinformatics, (21) 1211–1218.Google Scholar
[31]Shannon, C. E., (1948), A Mathematical Theory of Communication, Bell System Technical Journal, (27), 379–423.Google Scholar
[32]Shmulevich, I., Dougherty, E., Kim, S. and Zhang, W., (2002), Probabilistic Boolean Networks: A Rule-based Uncertainty Model for Gene Regulatory Networks, Bioinformatics, (18), 261–274.Google Scholar
[33]Shmulevich, I., Dougherty, E., Kim, S. and Zhang, W., (2002), Control of Stationary Behavior in Probabilistic Boolean Networks by Means of Structural Intervention, Journal of Biological Systems, (10), 431–445.Google Scholar
[34]Shmulevich, I., Dougherty, E., Kim, S. and Zhang, W., (2002), From Boolean to Probabilistic Boolean Networks as Models of Genetic Regulatory Networks, Proceedings of the IEEE, (90), 1778–1792.Google Scholar
[35]Shmulevich, I. and Dougherty, E., (2007), Genomic Signal Processing, Princeton University Press, U.S.Google Scholar
[36]Smolen, P., Baxter, D. and Byrne, J., (2000), Mathematical Modeling of Gene Network, Neuron, (26), 567–580.Google Scholar
[37]Somogyi, R. and Sniegoski, C., (1996), Modeling the Complexity of Gene Networks: Understanding Multigenic and Pleiotropic Regulation, Complexity, (1), 45–63.Google Scholar
[38]Stewart, G. W. and Sun, J. G., (1990), Matrix Perturbation Theory, Academic Press, Boston.Google Scholar
[39]Van Zuylen, H. and Willumsen, L., (1980), The Most Likely Trip Matrix Estimated from Traffic Counts, Transportation Research, (14)(B), 281–293.Google Scholar
[40]Vahedi, G., Ivanov, I. and Dougherty, E., (2009), Inference of Boolean Networks Under Constraint on Bidirectional Gene Relationships, IET Systems Biology, (3), 191–202.Google Scholar
[41]Wilson, A., (1970), Entropy in Urban and Regional Modelling, Pion, London.Google Scholar
[42]Yang, H., Sasaki, T., Iida, Y. and Asakura, Y., (1992), Estimation of Origin-destination Matrices from Link Traffic Counts on Congested Network, Transportation Research, (26)(B), 417–434.Google Scholar
[43]Yang, H., Iida, Y. and Sasaki, T., (1994), The Equilibrium-based Origin-destination Estimation Problem, Transportation Research, (28)(B), 23–33.Google Scholar
[44]Zhang, S., Ching, W., Ng, M. and Akutsu, T., (2007), Simulation Study in Probabilistic Boolean Network Models for Genetic Regulatory Networks, Journal of Data Mining and Bioinformatics, (1), 217–240.CrossRefGoogle ScholarPubMed
[45]Zhang, S., Ching, W., Tsing, N., Leung, H. and Guo, D., (2008), A Multiple Regression Approach for Building Genetic Networks, Proceedings of the International Conference on BioMedical Engineering and Informatics (BMEI2008) Sanya, China (in CD-ROM).Google Scholar