Observability of Boolean networks: A graph-theoretic approach

Automatica

Volumn 49, Issue 8, 2013, Pages 2351-2362

  Laschov, Dmitriy ^a   Margaliot, Michael ^a   Even, Guy ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Boolean control networks; Computational complexity; Gene regulating networks; Logical systems; Observability; Observable graphs; Systems biology

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMICAL SYSTEMS; GRAPH THEORY; MAMMALS; OBSERVABILITY; POLYNOMIAL APPROXIMATION;

ALGEBRAIC REPRESENTATIONS; BOOLEAN CONTROL NETWORKS; DISCRETE-TIME DYNAMICAL SYSTEMS; GRAPH THEORETIC APPROACH; LOGICAL SYSTEM; OBSERVABLE GRAPHS; POLYNOMIAL TIME COMPLEXITY; SYSTEMS BIOLOGY;

COMPLEX NETWORKS;

EID: 84882450040     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2013.04.038     Document Type: Article

References (63)

1. Akutsu, T., Hayashida, M., Ching, W.-K. & Ng, M. K. (2007). Control of Boolean networks: hardness results and algorithms for tree structured networks. Journal of Theoretical Biology, 244, 670-679.
2. Akutsu, T., Kuhara, S., Maruyama, O. & Miyano, S. (1998). A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions. In S. Miyano & T. Takagi (Eds.), Genome informatics 1998 (pp. 151-160). Tokyo: Universal Academy Press.
3. Akutsu, T., Miyano, S. & Kuhara, S. (2000). Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function. Journal of Computational Biology, 7, 331-343.
4. Albert, R. & Barabasi, A.-L. (2000). Dynamics of complex systems: scaling laws for the period of Boolean networks. Physical Review Letters, 84, 5660-5663.
5. Albert, R. & Othmer, H. G. (2003). The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in Drosophila melanogaster. Journal of Theoretical Biology, 223, 1-18.
6. Aldana, M. (2003). Boolean dynamics of networks with scale-free topology. Physica D, 185, 45-66.
7. Bernstein, D. S. (2005). Matrix mathematics. Princeton University Press.
8. Blondel, V. D. & Tsitsiklis, J. N. (2000). A survey of computational complexity results in systems and control. Automatica, 36, 1249-1274.
9. Bornholdt, S. (2008). Boolean network models of cellular regulation: prospects and limitations. Journal of the Royal Society Interface, 5, S85-S94.
10. Chaos, A., Aldana, M., Espinosa-Soto, C., de Leon, B. G. P., Arroyo, A. G. & Alvarez-Buylla, E. R. (2006). From genes to flower patterns and evolution: dynamic models of gene regulatory networks. Journal of Plant Growth Regulation, 25, 278-289.
11. Chaves, M., Albert, R. & Sontag, E. D. (2005). Robustness and fragility of Boolean models for genetic regulatory networks. Journal of Theoretical Biology, 235, 431-449.
12. Cheng, D. (2009). Input-state approach to Boolean networks. IEEE Transactions on Neural Networks, 20, 512-521.
13. Cheng, D. (2011). Disturbance decoupling of Boolean control networks. IEEE Transactions on Automatic Control, 56, 2-10.
14. Cheng, D., Li, Z. & Qi, H. (2010). Realization of Boolean control networks. Automatica, 46, 62-69.
15. Cheng, D. & Qi, H. (2009). Controllability and observability of Boolean control networks. Automatica, 45, 1659-1667.
16. Cheng, D., & Qi, H. (2010a). A linear representation of dynamics of Boolean networks. IEEE Transactions on Automatic Control, 55, 2251-2258.
17. Cheng, D. & Qi, H. (2010b). State-space analysis of Boolean networks. IEEE Transactions on Neural Networks, 21, 584-594.
18. Cheng, D., Qi, H. & Li, Z. (2011). Analysis and control of Boolean networks. Springer-Verlag.
19. Cheng, D. & Zhao, Y. (2011). Identification of Boolean control networks. Automatica, 47, 702-710.
20. Cobelli, C. & Romanin-Jacur, G. (1976). Controllability, observability and structural identifiability of multi input and multi output biological compartmental systems. IEEE Transactions on Biomedical Engineering, BME-23, 93-100.
21. Datta, A., Pal, R., Choudhary, A. & Dougherty, E. R. (2010). Control approaches for probabilistic gene regulatory networks. IEEE Signal Processing Magazine, 24, 54-63.
22. Derrida, B. & Pomeau, Y. (1986). Random networks of automata: a simple annealed approximation. Europhysics Letters, 1, 45-49.
23. Drossel, B., Mihaljev, T. & Greil, F. (2005). Number and length of attractors in a critical Kauffman model with connectivity one. Physical Review Letters, 94, 088701.
24. Elliott, D. L. (2009). Bilinear control systems: matrices in action. Springer.
25. Espinosa-Soto, C., Padilla-Longoria, P. & Alvarez-Buylla, E. R. (2004). A gene regulatory network model for cell-fate determination during Arabidopsis thaliana flower development that is robust and recovers experimental gene expression profiles. Plant Cell, 16, 2923-2939.
26. Faure, A., Naldi, A., Chaouiya, C., & Thieffry, D. (2006). Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle. Bioinformatics, 22, e124-e131.
27. Faure, A. & Thieffry, D. (2009). Logical modelling of cell cycle control in eukaryotes: a comparative study. Molecular BioSystems, 5, 1569-1581.
28. Fornasini, E. & Valcher, M. E. (2012). Observability, reconstructibility and state observers of Boolean control networks. IEEE Transactions on Automatic Control (submitted for publication).
29. Garcia, M. R., Vilas, C., Banga, J. R. & Alonso, A. A. (2008). Exponential observers for distributed tubular (bio)reactors. AIChE Journal, 54, 2943-2956.
30. Garey, M. R. & Johnson, D. S. (1990). Computers and intractability: a guide to the theory of NP-completeness. New York, NY: W. H. Freeman & Co.
31. Garg, A., Cara, A. D., Xenarios, I., Mendoza, L. & Micheli, G. D. (2008). Synchronous versus asynchronous modeling of gene regulatory networks. Bioinformatics, 24, 1917-1925.
32. Geffen, D., Findeisen, R., Schliemann, M., Allgower, F. & Guay, M. (2008). Observability based parameter identifiability for biochemical reaction networks. In Proc. American control conference (pp. 2130-2135). Seattle, Washington.
33. Green, D. G., Leishman, T. G. & Sadedin, S. (2007). The emergence of social consensus in Boolean networks. In IEEE symp. artificial life, ALIFE'07. (pp. 402-408). Honolulu, HI.
34. Gupta, S., Bisht, S. S., Kukreti, R., Jain, S. & Brahmachari, S. K. (2007). Boolean network analysis of a neurotransmitter signaling pathway. Journal of Theoretical Biology, 244, 463-469.
35. Harvey, I. & Bossomaier, T. (1997). Time out of joint: attractors in asynchronous random Boolean networks. In Proc. fourth European conf. artificial life, ECAL97. (pp. 67-75). Brighton, England.
36. Hassoun, M. H. (1995). Fundamentals of artificial neural networks. MIT Press.
37. Hinkelmann, F. & Laubenbacher, R. (2011). Boolean models of bistable biological systems. Discrete and Continuous Dynamical Systems-Series S, 4, 1443-1456.
38. Hopfensitz, M., Mussel, C., Wawra, C., Maucher, M., Kuhl, M., Neumann, H. & Kestler, H. A. (2012). Multiscale binarization of gene expression data for reconstructing Boolean networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9, 487-498.
39. Huang, S. (2002). Regulation of cellular states in mammalian cells from a genomewide view. In J. Collado-Vides & R. Hofestadt (Eds.), Gene regulation and metabolism (pp. 181-220). MIT Press.
40. Jungers, R. M. & Blondel, V. D. (2011). Observable graphs. Discrete Applied Mathematics, 159, 981-989.
41. Katz, R. H. (1994). Contemporary logic design. Redwood City, CA: The Benjamin/ Cummings Publishing Company.
42. Kauffman, S. A. (1969). Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology, 22, 437-467.
43. Kauffman, S. A. (1993). Origins of order: self-organization and selection in evolution. Oxford University Press.
44. Kauffman, S., Peterson, C., Samuelsson, B. & Troein, C. (2003). Random Boolean network models and the yeast transcriptional network. Proceedings of the National Academy of Sciences USA, 100, 14796-14799.
45. Kobayashi, K. & Imura, J.-I. (2009). Observability analysis of Boolean networks with biological applications. In Proc. int. joint conf. ICROS-SICE. Fukuoka, Japan (pp. 4393-4396).
46. Laschov, D. & Margaliot, M. (2011). A maximum principle for single-input Boolean control networks. IEEE Transactions on Automatic Control, 56, 913-917.
47. Laschov, D. & Margaliot, M. (2012). Controllability of Boolean control networks via the Perron-Frobenius theory. Automatica, 48, 1218-1223.
48. Laschov, D. & Margaliot, M. (2012). A Pontryagin maximum principle for multiinput Boolean control networks. In E. Kaslik & S. Sivasundaram (Eds.), Recent advances in dynamics and control of neural networks. Cambridge Scientific Publishers (in press-a).
49. Laschov, D. & Margaliot, M. (2013). Minimum-time control of Boolean networks. SIAM Journal on Control and Optimization, (in press-b).
50. Li, S., Assmann, S. M. & Albert, R. (2006). Predicting essential components of signal transduction networks: a dynamic model of guard cell abscisic acid signaling. PLoS Biology, 4, 1732-1748.
51. Li, F., Long, T., Lu, Y., Ouyang, Q. & Tang, C. (2004). The yeast cell-cycle network is robustly designed. Proceedings of the National Academy of Sciences USA, 101, 4781-4786.
52. Liu, Q., Guo, X. & Zhou, T. (2010). Optimal control for probabilistic Boolean networks. IET Systems Biology, 4, 99-107.
53. Lopez, I., Gamez, M. & Carreno, R. (2004). Observability in dynamic evolutionary models. BioSystems, 73, 99-109.
54. Luque, B. & Sole, R. V. (2000). Lyapunov exponents in random Boolean networks. Physica A: Statistical Mechanics and its Applications, 284, 33-45.
55. Saadatpour, A., Albert, I. & Albert, R. (2010). Attractor analysis of asynchronous Boolean models of signal transduction networks. Journal of Theoretical Biology, 266(4), 641-656.
56. Samuelsson, B. & Troein, C. (2003). Superpolynomial growth in the number of attractors in Kauffman networks. Physical Review Letters, 90, 098701.
57. Shmulevich, I., Dougherty, E. R., Kim, S. & Zhang, W. (2002). Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks. Bioinformatics, 18, 261-274.
58. Shmulevich, I., Dougherty, E. R. & Zhang, W. (2002). From Boolean to probabilistic Boolean networks as models of genetic regulatory networks. Proceedings of the IEEE, 90, 1778-1792.
59. Szallasi, Z. & Liang, S. (1998). Modeling the normal and neoplastic cell cycle with "realistic Boolean genetic networks": their application for understanding carcinogenesis and assessing therapeutic strategies. Pacific Symposium on Biocomputing, 3, 66-76.
60. Williamson, D. (1977). Observation of bilinear systems with application to biological control. Automatica, 13, 243-254.
61. Yin, Z. (2011). A Floyd-like algorithm for optimization of mix-valued logical control networks. In 30th Chinese control conference, CCC'2011. (pp. 1972-1977). Yantai, China.
62. Zhao, Q. (2005). A remark on scalar equations for synchronous Boolean networks with biological applications by C. Arrow, J. Heidel, J. Maloney, and J. Rogers. IEEE Transactions on Neural Networks, 16, 1715-1716.
63. Zhao, Y., Qi, H. & Cheng, D. (2010). Input-state incidence matrix of Boolean control networks and its applications. Systems & Control Letters, 59, 767-774.