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].”
Method
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.