The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Genetic networks with canalyzing Boolean rules are always stable
Open accessAbstract
We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and flat in-degree distributions, we find that the networks are dynamically stable. Furthermore, for architectures with few inputs per node, the dynamics of the networks is close to critical. In addition, the fraction of genes that are active decreases with the number of inputs per node. These results are based upon investigating ensembles of networks using analytical methods. Also, for different in-degree distributions, the numbers of fixed points and cycles are calculated, with results intuitively consistent with stability analysis; fewer inputs per node implies more cycles, and vice versa. There are hints that genetic networks acquire broader degree distributions with evolution, and hence our results indicate that for single cells, the dynamics should become more stable with evolution. However, such an effect is very likely compensated for by multicellular dynamics, because one expects less stability when interactions among cells are included. We verify this by simulations of a simple model for interactions among cells.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
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
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Random Networks of Automata: A Simple Annealed Approximation
Derrida, B., & Pomeau, Y. (1986) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/1/2/001 · Cited by 706
Origins of Order in Evolution: Self-Organization and Selection
Kauffman, S. A. (1992) · Understanding Origins · doi:10.1007/978-94-015-8054-0_8 · Cited by 642
Self-citationRandom Boolean network models and the yeast transcriptional network
Kauffman, S., Peterson, C., Samuelsson, B., & Troein, C. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2036429100 · Cited by 553
Self-citationBoolean dynamics of networks with scale-free topology
Aldana, M. (2003) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(03)00174-x · Cited by 398
A model of transcriptional regulatory networks based on biases in the observed regulation rules
Harris, S. E., Sawhill, B. K., Wuensche, A., & Kauffman, S. (2002) · Complexity · doi:10.1002/cplx.10022 · Cited by 277
Self-citationA natural class of robust networks
Aldana, M., & Cluzel, P. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1536783100 · Cited by 251
RegulonDB: a database on transcriptional regulation in Escherichia coli
Huerta, A. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.1.55 · Cited by 197
Evolution of overlaps between configurations in random Boolean networks
Derrida, B., & Weisbuch, G. (1986) · Journal de Physique · doi:10.1051/jphys:019860047080129700 · Cited by 177
From topology to dynamics in biochemical networks
Fox, J. J., & Hill, C. C. (2001) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.1414882 · Cited by 102
Exact solution of Kauffman's model with connectivity one
Flyvbjerg, H., & Kjr, N. J. (1988) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/21/7/031 · Cited by 98
Cited by
Millan, M. J. (2006) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2005.11.006 · Cited by 551
Being Critical of Criticality in the Brain
Beggs, J. M., & Timme, N. (2012) · Frontiers in Physiology · doi:10.3389/fphys.2012.00163 · Cited by 494
Robustness can evolve gradually in complex regulatory gene networks with varying topology
Ciliberti, S., Martin, O. C., & Wagner, A. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030015 · Cited by 390
Boolean network models of cellular regulation: prospects and limitations
Bornholdt, S. (2008) · Journal of The Royal Society Interface · doi:10.1098/rsif.2008.0132.focus · Cited by 394
Wang, X., & Gao, S. (2020) · Information Sciences · doi:10.1016/j.ins.2020.06.030 · Cited by 313
Metadata
- Authors
- Kauffman, S., Peterson, C., Samuelsson, B., & Troein, C.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2004-11-30
- Volume
- 101
- Issue
- 49
- Pages
- 17102-17107
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2097263107
- Cited by
- 340
- References
- 14
- FWCI
- 5.58
- Type
- journal article
- Language
- en
- Open access
- green
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.