Abstract
Boolean networks have been used as models of gene regulation networks and other biological systems. One key element in these models is the update schedule, which indicates the order in which states are to be updated. The presence of any limit cycle in the dynamics of a network depends on the update scheme used. Here, we study the complexity of the problems of determining the existence of a block-sequential update schedule for a given Boolean network such that it yields any limit cycle (LCE) and does not yield any limit cycle (LCNE). Besides, we prove that in AND-OR networks LCE is NP-hard and LCNE is coNP-hard. Finally, we show that both problems are polynomial in symmetric AND-OR networks. For these networks, we find a polynomial characterization for the existence of limit cycles in terms of the interaction digraph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aracena J, Gómez L, Salinas L (2013) Limit cycles and update digraphs in Boolean networks. Discret Appl Math 161:1–2
Aracena J, Goles E, Moreira A, Salinas L (2009) On the robustness of update schedules in Boolean networks. Biosystems 97:1–8
Bridoux F, Gaze-Maillot C, Perrot K, Sené S (2020) Complexity of limit-cycle problems in boolean networks (2020). arXiv:2001.07391
Davidich MI, Bornholdt S (2008) Boolean network model predicts cell cycle sequence of fission yeast. PloS one 3(2):e1672
Demongeot J, Elena A, Sené S (2008) Robustness in regulatory networks: a multi-disciplinary approach. Acta Biotheor 56(1–2):27–49
Fauré 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(14):e124–e131
Goles E, Hernández G (2000) Dynamical behavior of Kauffman networks with and-or gates. J Biol Syst 8:151–175
Goles E, Noual M (2012) Disjunctive networks and update schedules. Adv Appl Math 48:646–662
Goles E (1982) Fixed point behavior of threshold functions on a finite set. SIAM J Algebr Discrete Methods 3(4):529–531
Goles E, Montalva M, Ruz GA (2013) Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks. Bull Math Biol 75(6):939–966
Goles E, Montealegre P (2014) Computational complexity of threshold automata networks under different updating schemes. Theoret Comput Sci 559:3–19
Goles E, Olivos J (1980) Periodic behaviour of generalized threshold functions. Discret Math 30(2):187–189
Gómez L (2015) Dynamics of discrete networks with deterministic updates schedules. Application to genetic regulatory networks. PhD thesis in mathematical engineering, Universidad de Concepción, Concepción, Chile
Green DG, Leishman TG, Sadedin S (2007) The emergence of social consensus in Boolean networks. In: IEEE symposium on artificial life, 2007. ALIFE’07. IEEE, pp 402–408
Just W (2006) The steady state system problem is np-hard even for monotone quadratic boolean dynamical systems. Submitted to Annals of Combinatorics
Kauffman SA (1969) Metabolic stability and epigenesis in randomly connected nets. J Theor Biol 22:437–467
Kauffman SA (1993) The origins of order: self-organization and selection in evolution. Oxford University Press, New York
Macauley M, Mortveit HS (2009) Cycle equivalence of graph dynamical systems. Nonlinearity 22(2):421
Mortveit HS (2012) Limit cycle structure for block-sequential threshold systems. In: Cellular automata. Springer, pp 672–678
Porat S (1989) Stability and looping in connectionist models with asymmetric weights. Biol Cybern 60(5):335–344
Robert F (1986) Discrete iterations: a metric study. Springer, Berlin
Robert F (1995) Les systemes dynamiques discrets, vol 19. Springer Science & Business Media, Berlin
Ruz GA, Timmermann T, Barrera J, Goles E (2014) Neutral space analysis for a boolean network model of the fission yeast cell cycle network. Biol Res 47(1):64
Thomas R (1973) Boolean formalization of genetic control circuits. J Theor Biol 42:563–585
Thomas R (1980) On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations. Springer Ser Synergetics 9:180–193
Tocci R, Widmer N (2001) Digital systems: principles and applications, 7th edn. Prentice-Hall, Hoboken
Acknowledgements
This work was supported by Centro de Modelamiento Matemático (CMM), ACE2100010 and FB210005, BASAL funds for center of excellence from ANID-Chile.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Salinas, L., Gómez, L., Aracena, J. (2022). Existence and Non Existence of Limit Cycles in Boolean Networks. In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42. Springer, Cham. https://doi.org/10.1007/978-3-030-92551-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-92551-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92550-5
Online ISBN: 978-3-030-92551-2
eBook Packages: EngineeringEngineering (R0)