The Robustness of Balanced Boolean Networks

Part of the Studies in Computational Intelligence book series (SCI, volume 424)

Abstract

One of the characteristic features of genetic regulatory networks is their inherent robustness, that is, their ability to retain functionality in spite of the introduction of random errors. In this paper, we focus on the robustness of Balanced Boolean Networks (BBNs), which is a special kind of Boolean Network model of genetic regulatory networks. Our goal is to formalize and analyse the robustness of BBNs. Based on these results, applications using Boolean network model can be improved and optimized to be more robust.

We formalize BBNs and introduce a method to construct BBNs for 2-singleton attractors Boolean networks. The experiment results show that BBNs have a good performance on tolerating the single stuck-at faults on every edge. Our method improves the robustness of Boolean networks by at least 13% in average, and in some special case, up to 61%.

Keywords

Boolean Function Boolean Network Genetic Regulatory Network State Transition Graph Boolean Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Othmer, H.G.: 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 (2003)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Alberts, B., Bray, D., Lewis, J., Ra, M., Roberts, K., Watson, J.D.: Molecular Biology of the Cell. Garland Publishing (1994)Google Scholar
  3. 3.
    Dubrova, E., Liu, M., Teslenko, M.: Finding attractors in synchronous multiple-valued networks using SAT-based bounded model checking. In: Proceedings of the 2010 40th IEEE International Symposium on Multiple-Valued Logic (2011)Google Scholar
  4. 4.
    Dubrova, E., Teslenko, M.: A SAT-based algorithm for computing attractors in synchronous Boolean networks. IEEE/ACM Trans. Comput. Biol. Bioinformatics 8, 1393–1399 (2011)CrossRefGoogle Scholar
  5. 5.
    Espinosa-Soto, C., Padilla-Longoria, P., Alvarez-Buylla, E.R.: A gene regulatory network model for cell-fate determination during arabidopsis thaliana flower development that is robust and recovers experimental gene expression profiles. The Plant Cell 16, 2923–2939 (2004)CrossRefGoogle Scholar
  6. 6.
    Gershenson, C., Kauffman, S.A., Shmulevich, I.: The role of redundancy in the robustness of random boolean networks. In: Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems (2006)Google Scholar
  7. 7.
    Hassoun, S., Sasao, T. (eds.): Logic Synthesis and Verification. Kluwer Academic Publishers, USA (2002)Google Scholar
  8. 8.
    He, C., Ren, Q.: Robustness during network evolution. In: International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009, pp. 1240–1244 (2009)Google Scholar
  9. 9.
    Helikar, T., Kochi, N., Konvalina, J., Rogers, J.A.: Boolean modeling of biochemical networks. The Open Bioinformatics Journal 5, 16–25 (2011)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Huang, S., Ingber, D.E.: Shape-dependent control of cell growth, differentiation, and apoptosis: Switching between attractors in cell regulatory networks. Experimental Cell Research 261, 91–103 (2000)CrossRefGoogle Scholar
  11. 11.
    Kauffman, S.A.: Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology 22, 437–467 (1969)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Kauffman, S.A.: The Origins of Order: Self-Organization and Selection of Evolution. Oxford University Press (1993)Google Scholar
  13. 13.
    Kauffman, S.A.: At Home in the Universe: The Search for the Laws of Self-Organization and Complexity. Oxford University Press (1996)Google Scholar
  14. 14.
    Li, F., Long, T., Lu, Y., Ouyang, Q., Tang, C.: The yeast cell-cycle network is robustly designed. Proceedings of the National Academy of Sciences of the USA (PNAS) (2004)Google Scholar
  15. 15.
    Mishchenko, A., Chatterjee, S., Brayton, R.: Dag-aware aig rewriting: a fresh look at combinational logic synthesis. In: Proceedings of the 43rd Annual Design Automation Conference (2006)Google Scholar
  16. 16.
    Sahin, O., Fröhlich, H., Löbke, C., Korf, U., Burmester, S., Majety, M., Mattern, J., Schupp, I., Chaouiya, C., Thieffry, D., Poustka, A., Wiemann, S., Beißbarth, T., Arlt, D.: Modeling ERBB receptor-regulated G1/S transition to find novel targets for de novo trastuzumab resistance. BMC Systems Biology 3, 1–20 (2009)CrossRefGoogle Scholar
  17. 17.
    Schmal, C., Peixoto, T.P., Drossel, B.: Boolean networks with robust and reliable trajectories. New Journal of Physics 12, 113, 054 (2010)CrossRefGoogle Scholar
  18. 18.
    Wagner, A.: Robustness and evolvability in living systems. Oxford University Press (2007)Google Scholar
  19. 19.
    Wuensche, A.: Basins of Attraction in Network Dynamics: A Conceptual Framework for Biomolecular Networks. Chicago University Press (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.School of Information and Communication TechnologyRoyal Institute of Technology(KTH)StockholmSweden

Personalised recommendations