Skip to main content
×
Home
    • Aa
    • Aa

On Construction of Sparse Probabilistic Boolean Networks

  • Xi Chen (a1), Hao Jiang (a1) and Wai-Ki Ching (a1)
Abstract
Abstract

In this paper we envisage building Probabilistic Boolean Networks (PBNs) from a prescribed stationary distribution. This is an inverse problem of huge size that can be subdivided into two parts — viz. (i) construction of a transition probability matrix from a given stationary distribution (Problem ST), and (ii) construction of a PBN from a given transition probability matrix (Problem TP). A generalized entropy approach has been proposed for Problem ST and a maximum entropy rate approach for Problem TP respectively. Here we propose to improve both methods, by considering a new objective function based on the entropy rate with an additional term of La-norm that can help in getting a sparse solution. A sparse solution is useful in identifying the major component Boolean networks (BNs) from the constructed PBN. These major BNs can simplify the identification of the network structure and the design of control policy, and neglecting non-major BNs does not change the dynamics of the constructed PBN to a large extent. Numerical experiments indicate that our new objective function is effective in finding a better sparse solution.

Copyright
Corresponding author
Corresponding author. Email: dlkcissy@hku.hk
Corresponding author. Email: haohao@hkusuc.hku.hk
Corresponding author. Email: wching@hku.hk
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1]T. Akutsu , M. Hayasida , W Ching and M. Ng , Control of Boolean Networks: Hardness Results and Algorithms for Tree Structured Networks, Journal of Theoretical Biology, 2007, 244: 670679.

[2]E. J. Candes and T. Tao , Near-optimal Signal Recovery from Random Projections: Universal Encoding Strategies, IEEE Transactions on Information Theory, 2006, 52: 54065425.

[3]J. E. Celis , M. Kruhøfferm , I. Gromova , C. Frederiksen , M. Østergaard and T. F. Ørntoft , Gene Expression Profiling: Monitoring Transcription and Translation Products Using DNA Microarrays and Proteomics, FEBS Letters, 2000, 480(1): 216.

[6]W. Ching , S. Scholtes and S. Zhang , Numerical Algorithms for Estimating Traffic Between Zones in a Network, Engineering Optimisation, 36 (2004), 379400.

[7]W. Ching , E. Fung , M. Ng and T. Akutsu , On Construction of Stochastic Genetic Networks Based on Gene Expression Sequences, International Journal of Neural Systems, 15 (2005), 297310.

[9]W. Ching , S. Zhang , M. Ng and T. Akutsu , An Approximation Method for Solving the Steady-state Probability Distribution of Probabilistic Boolean Networks, Bioinformatics, 2007, 23: 15111518.

[10]W. Ching , S. Zhang , Y. Jiao , T. Akutsu and A. Wong , Optimal Control Policy for Probabilistic Boolean Networks with Hard Constraints, IET on Systems Biology, 2009, 3: 9099.

[13]A. Conn , B. Gould and P. Toint , Trust-region Methods, SIAM Publications, Philadelphia, 2000.

[14]E. Dougherty , S. Kim and Y. Chen , Coefficient of Determination in Nonlinear Signal Processing, Signal Processing, 2000, 80: 22192235.

[15]H. De Jong , Modeling and Simulation of Genetic Regulatory Systems: A Literature Review, Journal of Computational Biology, 2002, 9: 69103.

[16]S. Huang , Gene Expression Profiling, Genetic Networks, and Cellular States: An Integrating Concept for Tumorigenesis and Drug Discovery, Journal of Molecular Medicine, 1999, 77: 469480.

[17]S. Huang and D. E. Ingber , Shape-dependent Control of Cell Growth, Differentiation, and Apop-tosis: Switching Between Attractors in Cell Regulatory Networks, Experimental Cell Research, 2000, 261: 91103.

[18]S. Kauffman , Metabolic Stability and Epigenesis in Randomly Constructed Gene Nets, Journal of Theoretical Biology, 1969, 22: 437467.

[21]R. Pal , I. Ivanov , A. Datta , M. Bittner and E. Dougherty , Generating Boolean Networks with a Prescribed Attractor Structure, Bioinformatics, 2005, 21: 40214025.

[22]C.E. Shannon , A Mathematical Theory of Communication, Bell System Technical Journal, 1948, 27: 379423.

[23]I. Shmulevich , E. Dougherty , S. Kim and W. Zhang , Probabilistic Boolean Networks: A Rule-based Uncertainty Model for Gene Regulatory Networks, Bioinformatics, 2002, 18: 261274.

[25]P. Smolen , D. Baxter and J. Byrne , Mathematical Modeling of Gene Network, Neuron, 2000, 26: 567580.

[26]R. Somogyi and C. Sniegoski , Modeling the Complexity of Gene Networks: Understanding Multigenic and Pleiotropic Regulation, Complexity, 1996, 1: 4563.

[28]Y. Xiao and E. R. Dougherty , The Impact of Function Perturbations in Boolean Networks, Bioinformatics, 2007, 23(10): 12651273.

[30]S. Zhang , W. Ching , M. Ng and T. Akutsu , Simulation Study in Probabilistic Boolean Network Models for Genetic Regulatory Networks, Journal of Data Mining and Bioinformatics, 2007, 1: 217240.

[31]S. Zhang , W. Ching , N. Tsing , H. Leung and D. Guo , A New Multiple Regression Approach for the Construction of Genetic Regulatory Networks, Journal of Artificial Intelligence in Medicine, 2009, 48: 153160.

[32]S. Zhang , W. Ching , X. Chen and N. Tsing , On Construction of PBNs from a Prescribed Stationary Distribution, Information Sciences, 2010, 180: 25602570.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

East Asian Journal on Applied Mathematics
  • ISSN: 2079-7362
  • EISSN: 2079-7370
  • URL: /core/journals/east-asian-journal-on-applied-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords: