Computing maximal and minimal trap spaces of Boolean networks
Asymptotic behaviors are often of particular interest when analyzing Boolean networks that represent biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called trap spaces, can be exploited to investigate attractor properties as well as for model reduction techniques. In this paper, we propose a novel optimization-based method for computing all minimal and maximal trap spaces and motivate their use. In particular, we add a new result yielding a lower bound for the number of cyclic attractors and illustrate the methods with a study of a MAPK pathway model. To test the efficiency and scalability of the method, we compare the performance of the ILP solver gurobi with the ASP solver potassco in a benchmark of random networks.
KeywordsBoolean networks Attractors Signal transduction Gene regulation Answer set programming Integer linear programming
Mathematics Subject Classification94C10 92B05
We thank S. Videla, M. Ostrowski and T. Schaub of University of Potsdam for their help with the ASP formulation.
- Gershenson C (2004) Updating schemes in random boolean networks: do they really matter. In: Artificial life IX Proceedings of the 9th international conference on the simulation and synthesis of living systems, MIT Press, pp 238–243Google Scholar
- Gurobi Optimization I (2015) Gurobi optimizer reference manual. www.gurobi.com
- Jabbour S, Marques-Silva J, Sais L, Salhi Y (2014) Enumerating prime implicants of propositional formulae in conjunctive normal form. In: Fermé E, Leite J (eds) Logics in artificial intelligence. Springer, pp 152–165Google Scholar
- Kauffman SA (1993) The origins of order: self organization and selection in evolution. Oxford University Press, USAGoogle Scholar
- Klarner H (2015) www.sourceforge.net/Projects/BoolNetFixpoints
- Klarner H, Bockmayr A, Siebert H (2014) Computing symbolic steady states of boolean networks. In: Was J, Sirakoulis G, Bandini S (eds) Cellular Automata, Lecture Notes in Computer Science, vol 8751, Springer International Publishing, pp 561–570Google Scholar
- Paulevé L, Chancellor C, Folschette M, Magnin M, Roux O (2014) Analyzing large network dynamics with process hitting. Log Model Biol Syst pp 125–166. doi: 10.1002/9781119005223.ch4