In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interactions, a state transition graph is constructed that captures the dynamics of the system. In the late eighties, Snoussi and Thomas extended the original framework by including singular values corresponding to interaction thresholds. They showed that these are needed for a refined understanding of the network dynamics. In this paper, we study systematically singular steady states, which are characteristic of feedback circuits in the interaction graph, and relate them to the type, number and cardinality of attractors in the state transition graph. In particular, we derive sufficient conditions for regulatory networks to exhibit multistationarity or oscillatory behavior, thus giving a partial converse to the well-known Thomas conjectures. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Siebert, H., & Bockmayr, A. (2007). Relating attractors and singular steady states in the logical analysis of bioregulatory networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4545 LNCS, pp. 36–50). Springer Verlag. https://doi.org/10.1007/978-3-540-73433-8_4
Mendeley helps you to discover research relevant for your work.