The role of certain Post classes in Boolean network models of genetic networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A topic of great interest and debate concerns the source of order and remarkable robustness observed in genetic regulatory networks. The study of the generic properties of Boolean networks has proven to be useful for gaining insight into such phenomena. The main focus, as regards ordered behavior in networks, has been on canalizing functions, internal homogeneity or bias, and network connectivity. Here we examine the role that certain classes of Boolean functions that are closed under composition play in the emergence of order in Boolean networks. The closure property implies that any gene at any number of steps in the future is guaranteed to be governed by a function from the same class. By means of Derrida curves on random Boolean networks and percolation simulations on square lattices, we demonstrate that networks constructed from functions belonging to these classes have a tendency toward ordered behavior. Thus they are not overly sensitive to initial conditions, and damage does not readily spread throughout the network. In addition, the considered classes are significantly larger than the class of canalizing functions as the connectivity increases. The functions in these classes exhibit the same kind of preference toward biased functions as do canalizing functions, meaning that functions from this class are likely to be biased. Finally, functions from this class have a natural way of ensuring robustness against noise and perturbations, thus representing plausible evolutionarily selected candidates for regulatory rules in genetic networks.
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
Kauffman, S. A. (2000) · doi:10.1093/oso/9780195121049.001.0001 · Cited by 950
The large scale structure and dynamics of gene control circuits
Kauffman, S. (1974) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(74)80037-8 · Cited by 232
Robustness as an evolutionary principle
Bornholdt, S., & Sneppen, K. (2000) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2000.1280 · Cited by 132
Cited by
Cell Fates as High-Dimensional Attractor States of a Complex Gene Regulatory Network
Huang, S., Eichler, G., Bar-Yam, Y., & Ingber, D. E. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.128701 · Cited by 775
Fisher, J., & Henzinger, T. A. (2007) · Nature Biotechnology · doi:10.1038/nbt1356 · Cited by 538
Bonneau, R., Reiss, D. J., Shannon, P., Facciotti, M., Hood, L., Baliga, N. S., & Thorsson, V. (2006) · Genome Biology · doi:10.1186/gb-2006-7-5-r36 · Cited by 510
“We have not discussed the topology (higher order structure or local motifs) of the derived network [42-44].”
BackgroundRobustness 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
Metadata
- Authors
- Shmulevich, I., Lähdesmäki, H., Dougherty, E. R., Astola, J., & Zhang, W.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2003-09-08
- Volume
- 100
- Issue
- 19
- Pages
- 10734-10739
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2161473477
- Cited by
- 142
- References
- 3
- FWCI
- 3.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The role of certain Post classes in Boolean network models of genetic networks. https://app.cochat.ai/papers/10.1073/pnas.1534782100
- The paper
- Shmulevich, I., Lähdesmäki, H., Dougherty, E. R., Astola, J., & Zhang, W. (2003). The role of certain Post classes in Boolean network models of genetic networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1534782100
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.