Skip to main content
×
×
Home

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
References
Hide All
[1]Akutsu T., Hayasida M., Ching W and Ng M., Control of Boolean Networks: Hardness Results and Algorithms for Tree Structured Networks, Journal of Theoretical Biology, 2007, 244: 670679.
[2]Candes E. J. and Tao T., Near-optimal Signal Recovery from Random Projections: Universal Encoding Strategies, IEEE Transactions on Information Theory, 2006, 52: 54065425.
[3]Celis J. E., Kruhøfferm M., Gromova I., Frederiksen C., Østergaard M. and Ørntoft T. F., Gene Expression Profiling: Monitoring Transcription and Translation Products Using DNA Microarrays and Proteomics, FEBS Letters, 2000, 480(1): 216.
[4]Chen X., Ching W., Chen X., Cong Y. and Tsing N., Construction of Probabilistic Boolean Networks from a Prescribed Transition ProbabilityMatrix: A Maximum EntropyRate Approach, East Asian Journal of Applied Mathematics, 1 (2011) 132154.
[5]Chen X., Li L., Ching W. and Tsing N., A Modified Entropy Approach for Construction of Probabilistic Boolean Networks, Lecture Notes in Operations Research 13, Series Editors: Ding-Zhu Du and Xiang-Sun Zhang The Fourth International Conference on Computational Systems Biology (ISB2010) Suzhou, China, September 9-11, 2010, 13: 243250. Available at http://www.aporc.org/LNOR/13/ISB2010F32.pdf
[6]Ching W., Scholtes S. and Zhang S., Numerical Algorithms for Estimating Traffic Between Zones in a Network, Engineering Optimisation, 36 (2004), 379400.
[7]Ching W., Fung E., Ng M. and Akutsu T., On Construction of Stochastic Genetic Networks Based on Gene Expression Sequences, International Journal of Neural Systems, 15 (2005), 297310.
[8]Ching W. and Ng M., Markov Chains: Models, Algorithms and Applications, International Series on operations Research and Management Science, Springer: New York, 2006.
[9]Ching W., Zhang S., Ng M. and Akutsu T., An Approximation Method for Solving the Steady-state Probability Distribution of Probabilistic Boolean Networks, Bioinformatics, 2007, 23: 15111518.
[10]Ching W., Zhang S., Jiao Y., Akutsu T. and Wong A., Optimal Control Policy for Probabilistic Boolean Networks with Hard Constraints, IET on Systems Biology, 2009, 3: 9099.
[11]Ching W. and Cong Y., A New Optimization Model for the Construction of Markov Chains, CSO2009, Hainan, IEEE Computer Society Proceedings, 2009, 551555.
[12]Ching W., Chen X. and Tsing N., Generating Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix, IET on Systems Biology, 2009, 6: 453464.
[13]Conn A., Gould B. and Toint P., Trust-region Methods, SIAM Publications, Philadelphia, 2000.
[14]Dougherty E., Kim S. and Chen Y., Coefficient of Determination in Nonlinear Signal Processing, Signal Processing, 2000, 80: 22192235.
[15]De Jong H., Modeling and Simulation of Genetic Regulatory Systems: A Literature Review, Journal of Computational Biology, 2002, 9: 69103.
[16]Huang S., Gene Expression Profiling, Genetic Networks, and Cellular States: An Integrating Concept for Tumorigenesis and Drug Discovery, Journal of Molecular Medicine, 1999, 77: 469480.
[17]Huang S. and Ingber D. E., Shape-dependent Control of Cell Growth, Differentiation, and Apop-tosis: Switching Between Attractors in Cell Regulatory Networks, Experimental Cell Research, 2000, 261: 91103.
[18]Kauffman S., Metabolic Stability and Epigenesis in Randomly Constructed Gene Nets, Journal of Theoretical Biology, 1969, 22: 437467.
[19]Kauffman S., The Origins of Order: Self-organization and Selection in Evolution, New York: oxford univ. Press, 1993.
[20]Kim S., Imoto S. and Miyano S., 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, 2003, 2602: 104113.
[21]Pal R., Ivanov I., Datta A., Bittner M. and Dougherty E., Generating Boolean Networks with a Prescribed Attractor Structure, Bioinformatics, 2005, 21: 40214025.
[22]Shannon C.E., A Mathematical Theory of Communication, Bell System Technical Journal, 1948, 27: 379423.
[23]Shmulevich I., Dougherty E., Kim S. and Zhang W., Probabilistic Boolean Networks: A Rule-based Uncertainty Model for Gene Regulatory Networks, Bioinformatics, 2002, 18: 261274.
[24]Shmulevich I. and Dougherty E., Probabilistic Boolean Networks: The Modeling and Control of Gene Regulatory Networks, SIAM Press, 2009.
[25]Smolen P., Baxter D. and Byrne J., Mathematical Modeling of Gene Network, Neuron, 2000, 26: 567580.
[26]Somogyi R. and Sniegoski C., Modeling the Complexity of Gene Networks: Understanding Multigenic and Pleiotropic Regulation, Complexity, 1996, 1: 4563.
[27]Wilson A., Entropy in Urban and Regional Modelling, Pion, London, 1970.
[28]Xiao Y. and Dougherty E. R., The Impact of Function Perturbations in Boolean Networks, Bioinformatics, 2007, 23(10): 12651273.
[29]Xu Z., Zhang H., Wang Y. and Chang X., L 1/2 Regularization, Science in China Series Finformation Sciences, (2010), 40: 111.
[30]Zhang S., Ching W., Ng M. and Akutsu T., Simulation Study in Probabilistic Boolean Network Models for Genetic Regulatory Networks, Journal of Data Mining and Bioinformatics, 2007, 1: 217240.
[31]Zhang S., Ching W., Tsing N., Leung H. and Guo D., A New Multiple Regression Approach for the Construction of Genetic Regulatory Networks, Journal of Artificial Intelligence in Medicine, 2009, 48: 153160.
[32]Zhang S., Ching W., Chen X. and Tsing N., 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:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 132 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd January 2018. This data will be updated every 24 hours.