A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
The origins of order; self organization and selection in evolution
(1994) · International Journal of Biochemistry · doi:10.1016/0020-711x(94)90119-8 · Cited by 6,649
Metabolic stability and epigenesis in randomly constructed genetic nets
Kauffman, S. A. (1969) · Journal of Theoretical Biology · doi:10.1016/0022-5193(69)90015-0 · Cited by 4,819
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647 · cited 1×
“Propositional decision procedures (SAT) do not suffer from the potential space explosion of BDDs and can handle propositional satisability problems with thousands of variables [13].”
BackgroundGautier, J. (1993) · Trends in Biochemical Sciences · doi:10.1016/0968-0004(93)90025-i · Cited by 2,165
The yeast cell-cycle network is robustly designed
Li, F., Long, T., Lu, Y., Ouyang, Q., & Tang, C. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0305937101 · Cited by 1,108 · cited 1×
“in Table 1: control of flower morphogenesis in Arabidopsis thaliana[18], budding yeast cell cycle regulation [ 19 ], Drosophila melanogastersegment polarity genes expression patterns prediction [20], fission yeast cell cycle regulati on [21], the mammalian cell cycle regulation [22], T-cell receptor signaling pathway…”
BackgroundAlbert, R., & Othmer, H. G. (2003) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(03)00035-3 · Cited by 942 · cited 2×
“This is because the states of attractors represent the expression levels of genes in a given cell type, which are normally stable [ 20 ].”
BackgroundSymbolic model checking using SAT procedures instead of BDDs
Biere, A., Cimatti, A., Clarke, E. M., Fujita, M., & Zhu, Y. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.309942 · Cited by 752 · cited 1×
“The presented approach is based on SAT-based bounded model checking [14].”
MethodThe NK model of rugged fitness landscapes and its application to maturation of the immune response
Kauffman, S. A., & Weinberger, E. D. (1989) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(89)80019-0 · Cited by 669 · cited 1×
“In this paper, we consider the Boolean network model [3] which has been shown useful for exploring GRNs in the context of cellular differentiation [4], cell cycle sequence prediction [5], [6], maturation of the immune response [ 7 ], and evolution [8], [9].”
MethodDynamical analysis of a generic Boolean model for the control of the mammalian cell cycle
Fauré, A., Naldi, A., Chaouiya, C., & Thieffry, D. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl210 · Cited by 642 · cited 1×
“in Table 1: control of flower morphogenesis in Arabidopsis thaliana[18], budding yeast cell cycle regulation [19], Drosophila melanogastersegment polarity genes expression patterns prediction [20], fission yeast cell cycle regulati on [21], the mammalian cell cycle regulation [ 22 ], T-cell receptor signaling pathway…”
BackgroundHuang, S., & Ingber, D. E. (2000) · Experimental Cell Research · doi:10.1006/excr.2000.5044 · Cited by 606 · cited 1×
“In this paper, we consider the Boolean network model [3] which has been shown useful for exploring GRNs in the context of cellular differentiation [ 4 ], cell cycle sequence prediction [5], [6], maturation of the immune response [7], and evolution [8], [9].”
MethodRegulatory networks seen as asynchronous automata: A logical description
Thomas, R. (1991) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(05)80350-9 · Cited by 499 · cited 2×
“In [32], the problem of finding attractors of length 1 is addressed in the context of the generalized logical analysis [18], [ 33 ].”
BackgroundBoolean Network Model Predicts Cell Cycle Sequence of Fission Yeast
Davidich, M. I., & Bornholdt, S. (2008) · PLoS ONE · doi:10.1371/journal.pone.0001672 · Cited by 491 · cited 1×
“in Table 1: control of flower morphogenesis in Arabidopsis thaliana[18], budding yeast cell cycle regulation [19], Drosophila melanogastersegment polarity genes expression patterns prediction [20], fission yeast cell cycle regulati on [ 21 ], the mammalian cell cycle regulation [22], T-cell receptor signaling pathway…”
MethodA methodology for the structural and functional analysis of signaling and regulatory networks
Klamt, S., Saez-Rodriguez, J., Lindquist, J. A., Simeoni, L., & Gilles, E. D. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-56 · Cited by 395 · cited 1×
“in Table 1: control of flower morphogenesis in Arabidopsis thaliana[18], budding yeast cell cycle regulation [19], Drosophila melanogastersegment polarity genes expression patterns prediction [20], fission yeast cell cycle regulati on [21], the mammalian cell cycle regulation [22], T-cell receptor signaling pathway a…”
BackgroundCurrent approaches to gene regulatory network modelling
Schlitt, T., & Brazma, A. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s6-s9 · Cited by 335 · cited 1×
“Many mathematical models of GRNs have been developed including ordinary and partial differential equations, Boolean networks and their generalizations, Petri nets, Bayesian networks, stochastic equations, and process calculi [ 2 ].”
BackgroundBoolean Dynamics with Random Couplings
Aldana, M., Coppersmith, S., & Kadanoff, L. P. (2003) · Perspectives and Problems in Nolinear Science · doi:10.1007/978-0-387-21789-5_2 · Cited by 313 · cited 2×
“When the effect of a disease or a mutation on an organism is studied, attractors have to be re-computed every time a fault is injected in the model [ 3 ].”
MethodSynchronous versus asynchronous modeling of gene regulatory networks
Garg, A., Di Cara, A., Xenarios, I., Mendoza, L., & De Micheli, G. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn336 · Cited by 305 · cited 1×
“These types of attractors are common for synchronous and asynchronous models [ 46 ].”
BackgroundTopological Evolution of Dynamical Networks: Global Criticality from Local Dynamics
Bornholdt, S., & Rohlf, T. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.6114 · Cited by 271 · cited 1×
“In this paper, we consider the Boolean network model [3] which has been shown useful for exploring GRNs in the context of cellular differentiation [4], cell cycle sequence prediction [5], [6], maturation of the immune response [7], and evolution [ 8 ], [9].”
MethodA method for the generation of standardized qualitative dynamical systems of regulatory networks
Mendoza, L., & Xenarios, I. (2006) · Theoretical Biology and Medical Modelling · doi:10.1186/1742-4682-3-13 · Cited by 264
Batt, G., Ropers, D., de Jong, H., Geiselmann, J., Mateescu, R., Page, M., & Schneider, D. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1048 · Cited by 188 · cited 2×
“Various approaches based on Petri nets [15], Markov models [16], differential equations [ 12 ], Boolean networks [17], and other formalisms, have been presented.”
Scaling in Ordered and Critical Random Boolean Networks
Socolar, J. E. S., & Kauffman, S. A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.068702 · Cited by 182 · cited 1×
“Such an approach is used in many studies, including [25], [ 26 ], [27], [28].”
MethodSymbolic model checking using SAT procedures instead of BDDs
Biere, A., Cimatti, A., Clarke, E. M., Fujita, M., & Zhu, Y. (2003) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1109/dac.1999.781333 · Cited by 156
Stability of the Kauffman model
Bilke, S., & Sjunnesson, F. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.65.016129 · Cited by 139 · cited 1×
“Such an approach is used in many studies, including [ 25 ], [26], [27], [28].”
MethodEfficient Computation of Recurrence Diameters
Kroening, D., & Strichman, O. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36384-x_24 · Cited by 128
Akutsu, T., Kuhara, S., Maruyama, O., & Miyano, S. (1998) · PubMed · Cited by 126
Decision Diagrams for the Representation and Analysis of Logical Models of Genetic Networks
Naldi, A., Thieffry, D., & Chaouiya, C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75140-3_16 · Cited by 119 · cited 3×
“In [ 32 ], logical equations describing regulatory networks are represented by Decision Diagrams (either Binary (BDD) or multi-valued).”
BackgroundInfluentialDynamics of Boolean Networks Controlled by Biologically Meaningful Functions
Raeymaekers, L. (2002) · Journal of Theoretical Biology · doi:10.1006/jtbi.2002.3081 · Cited by 118 · cited 1×
“Such an approach is used in many studies, including [25], [26], [27], [ 28 ].”
MethodA Unifying Framework for Modelling and Analysing Biochemical Pathways Using Petri Nets
Gilbert, D., Heiner, M., & Lehrack, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75140-3_14 · Cited by 114 · cited 1×
“Various approaches based on Petri nets [ 15 ], Markov models [16], differential equations [12], Boolean networks [17], and other formalisms, have been presented.”
BackgroundPropositional Satisfiability and Constraint Programming
Bordeaux, L., Hamadi, Y., & Zhang, L. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177354 · Cited by 113 · cited 1×
“However, SAT works as a black-box approach, while CP is intended to be tunable [ 40 ].”
BackgroundIdentification of all steady states in large networks by logical analysis
Devloo, V., Hansen, P., & Labbé, M. (2003) · Bulletin of Mathematical Biology · doi:10.1016/s0092-8240(03)00061-2 · Cited by 94
Effects of alternative connectivity on behavior of randomly constructed Boolean networks
Oosawa, C., & Savageau, M. A. (2002) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(02)00530-4 · Cited by 70 · cited 1×
“Such an approach is used in many studies, including [25], [26], [ 27 ], [28].”
From Genes to Flower Patterns and Evolution: Dynamic Models of Gene Regulatory Networks
Chaos, Á., Aldana, M., Espinosa‐Soto, C., García‐Ponce, B., Garay‐Arroyo, A., & Alvarez-Buylla, E. R. (2006) · Journal of Plant Growth Regulation · doi:10.1007/s00344-006-0068-8 · Cited by 69 · cited 1×
“in Table 1: control of flower morphogenesis in Arabidopsis thaliana[ 18 ], budding yeast cell cycle regulation [19], Drosophila melanogastersegment polarity genes expression patterns prediction [20], fission yeast cell cycle regulati on [21], the mammalian cell cycle regulation [22], T-cell receptor signaling pathway…”
Backgroundde Jong, H., & Page, M. (2008) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.70254 · Cited by 65 · cited 4×
“In [ 10 ], a SAT-based algorithm for finding all attractors of length 1 in the model of the GRN based on a class of piecewiselinear differential equations has been presented.”
BackgroundMethodInfluentialImproving the efficiency of attractor cycle identification in Boolean networks
Irons, D. J. (2006) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2006.03.006 · Cited by 54 · cited 2×
“It is shown in [ 34 ] that such an approach allows for identifying all attractors in many Boolean networks with up to 80 nodes.”
BackgroundMethodAnalysing Biochemical Oscillation through Probabilistic Model Checking
Ballarini, P., Mardare, R., & Mura, I. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.02.002 · Cited by 33 · cited 1×
“Various approaches based on Petri nets [15], Markov models [ 16 ], differential equations [12], Boolean networks [17], and other formalisms, have been presented.”
BackgroundTamura, T., & Akutsu, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85101-1_16 · Cited by 9 · cited 2×
“In the second group, many algorithms for finding attractors of length 1 has been presented, including [29], [ 30 ], [31], [32], [10].”
MethodAlgorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
Mysore, V., & Mishra, B. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73433-8_13 · Cited by 7 · cited 1×
“Model checking has been successfully applied for analyzing genetic [12], metabolic [ 13 ], signal transduction [14], and other networks.”
Cited by
Boolean modeling in systems biology: an overview of methodology and applications
Wang, R.-S., Saadatpour, A., & Albert, R. (2012) · Physical Biology · doi:10.1088/1478-3975/9/5/055001 · Cited by 463
Concepts in Boolean network modeling: What do they all mean?
Schwab, J. D., Kühlwein, S. D., Ikonomi, N., Kühl, M., & Kestler, H. A. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2020.03.001 · Cited by 249
“The attractor search can be converted into a satisfiability problem [84] for which heuristics exist, but without revealing state transitions [84,85].”
BackgroundAttractor analysis of asynchronous Boolean models of signal transduction networks
Saadatpour, A., Albert, I., & Albert, R. (2010) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2010.07.022 · Cited by 178
Leveraging quantum computing for dynamic analyses of logical networks in systems biology
Weidner, F. M., Schwab, J. D., Wölk, S., Rupprecht, F., Ikonomi, N., Werle, S. D., Hoffmann, S., Kühl, M., & Kestler, H. A. (2023) · Patterns · doi:10.1016/j.patter.2023.100705 · Cited by 21
“While there are algorithms to screen for attractors in larger BNs, 17,32,33 the exponential growth of the numberof nodes in the STG prohibits its complete exploration as well as the iden-tification of basins of attraction.”
Method
Metadata
- Authors
- Dubrova, E., & Teslenko, M.
- Venue
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Published
- 2011-09
- Volume
- 8
- Issue
- 5
- Pages
- 1393-1399
- ISSN
- 1545-5963 (ISSN-L)
- OpenAlex
- W2166214692
- Cited by
- 186
- References
- 38
- FWCI
- 5.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.