The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Survival of the sparsest: robust gene networks are parsimonious
Open accessAbstract
Biological gene networks appear to be dynamically robust to mutation, stochasticity, and changes in the environment and also appear to be sparsely connected. Studies with computational models, however, have suggested that denser gene networks evolve to be more dynamically robust than sparser networks. We resolve this discrepancy by showing that misassumptions about how to measure robustness in artificial networks have inadvertently discounted the costs of network complexity. We show that when the costs of complexity are taken into account, that robustness implies a parsimonious network structure that is sparsely connected and not unnecessarily complex; and that selection will favor sparse networks when network topology is free to evolve. Because a robust system of heredity is necessary for the adaptive evolution of complex phenotypes, the maintenance of frugal network complexity is likely a crucial design constraint that underlies biological organization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The segment polarity network is a robust developmental module
von Dassow, G., Meir, E., Munro, E. M., & Odell, G. M. (2000) · Nature · doi:10.1038/35018085 · Cited by 1,144
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 · cited 4×
“…reported using more densely connected networks (Wagner, 1996; Siegal and Bergman, 2002; Bergman and Siegal, 2003; Masel, 2004; Azevedo et al, 2006; Ciliberti et al, 2007a, b; & 2008 EMBO and Nature Publishing Group Molecular Systems Biology 2008 1 Molecular Systems Biology 4; Article number 213;…”
BackgroundMethodInfluential
Cited by
Using graph theory to analyze biological networks
Pavlopoulos, G. A., Secrier, M., Moschopoulos, C. N., Soldatos, T. G., Kossida, S., Aerts, J., Schneider, R., & Bagos, P. G. (2011) · BioData Mining · doi:10.1186/1756-0381-4-10 · Cited by 791
SINCERA: A Pipeline for Single-Cell RNA-Seq Profiling Analysis
Guo, M., Wang, H., Potter, S. S., Whitsett, J. A., & Xu, Y. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004575 · Cited by 354
Basu, S., Duren, W., Evans, C. R., Burant, C. F., Michailidis, G., & Karnovsky, A. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx012 · Cited by 271
Evolution of resilience in protein interactomes across the tree of life
Zitnik, M., Sosič, R., Feldman, M. W., & Leskovec, J. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1818013116 · Cited by 130
Manrubia, S., Cuesta, J. A., Aguirre, J., Ahnert, S. E., Altenberg, L., Cano, A. V., Catalán, P., Diaz-Uriarte, R., Elena, S. F., García-Martín, J. A., et al. (2021) · Physics of Life Reviews · doi:10.1016/j.plrev.2021.03.004 · Cited by 88
Metadata
- Authors
- Leclerc, R. D.
- Venue
- Molecular Systems Biology
- Published
- 2008-01
- Volume
- 4
- Issue
- 1
- Pages
- 213-213
- ISSN
- 1744-4292 (ISSN-L)
- OpenAlex
- W2142170851
- Cited by
- 251
- References
- 2
- FWCI
- 4.84
- Type
- journal article
- Language
- en
- Open access
- gold
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: Survival of the sparsest: robust gene networks are parsimonious. https://app.cochat.ai/papers/10.1038/msb.2008.52
- The paper
- Leclerc, R. D. (2008). Survival of the sparsest: robust gene networks are parsimonious. Molecular Systems Biology. https://doi.org/10.1038/msb.2008.52
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.