Birth of scale-free molecular networks and the number of distinct DNA and protein domains per genome
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Motivation: Current growth in the field of genomics has provided a number of exciting approaches to the modeling of evolutionary mechanisms within the genome. Separately, dynamical and statistical analyses of networks such as the World Wide Web and the social interactions existing between humans have shown that these networks can exhibit common fractal properties—including the property of being scale-free. This work attempts to bridge these two fields and demonstrate that the fractal properties of molecular networks are linked to the fractal properties of their underlying genomes. Results: We suggest a stochastic model capable of describing the evolutionary growth of metabolic or signal-transduction networks. This model generates networks that share important statistical properties (so-called scale-free behavior) with real molecular networks. In particular, the frequency of vertices connected to exactly k other vertices follows a power-law distribution. The shape of this distribution remains invariant to changes in network scale: a small subgraph has the same distribution as the complete graph from which it is derived. Furthermore, the model correctly predicts that the frequencies of distinct DNA and protein domains also follow a power-law distribution. Finally, the model leads to a simple equation linking the total number of different DNA and protein domains in a genome with both the total number of genes and the overall network topology. Availability: MatLab (MathWorks, Inc.) programs described in this manuscript are available on request from the authors. Contact: ar345@columbia.edu * To whom correspondence should be addressed.
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
The Database of Interacting Proteins: 2004 update
Salwinski, L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh086 · Cited by 2,271
Apweiler, R. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.1.37 · Cited by 1,079
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
A General Framework for Weighted Gene Co-Expression Network Analysis
Zhang, B., & Horvath, S. (2005) · Statistical Applications in Genetics and Molecular Biology · doi:10.2202/1544-6115.1128 · Cited by 5,684
“, 2004; Butte and Kohane, 2000), protein-protein interaction networks (Jeong et al., 2001; Rzhetsky and Gomez, 2001; Yook et al., 2004), cell-cell interaction networks (Hartwell et al.”
InfluentialAfendi, F. M., Okada, T., Yamazaki, M., Hirai-Morita, A., Nakamura, Y., Nakamura, K., Ikeda, S., Takahashi, H., Altaf-Ul-Amin, M., Darusman, L. K., et al. (2012) · Plant and Cell Physiology · doi:10.1093/pcp/pcr165 · Cited by 738
Modeling cellular machinery through biological network comparison
Sharan, R., & Ideker, T. (2006) · Nature Biotechnology · doi:10.1038/nbt1196 · Cited by 559
Metadata
- Authors
- Rzhetsky, A., & Gomez, S. M.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2001-10-01
- Volume
- 17
- Issue
- 10
- Pages
- 988-996
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2103717646
- Cited by
- 144
- References
- 2
- FWCI
- 4.89
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Birth of scale-free molecular networks and the number of distinct DNA and protein domains per genome. https://app.cochat.ai/papers/10.1093/bioinformatics/17.10.988
- The paper
- Rzhetsky, A., & Gomez, S. M. (2001). Birth of scale-free molecular networks and the number of distinct DNA and protein domains per genome. Bioinformatics. https://doi.org/10.1093/bioinformatics/17.10.988
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.