The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A duplication growth model of gene expression networks
Open accessAbstract
Motivation: There has been considerable interest in developing computational techniques for inferring genetic regulatory networks from whole-genome expression profiles. When expression time series data sets are available, dynamic models can, in principle, be used to infer correlative relationships between gene expression levels, which may be causal. However, because of the range of detectable expression levels and the current quality of the data, the predictive nature of such inferred, quantitative models is questionable. Network models derived from simple rate laws offer an intermediate level analysis, going beyond simple statistical analysis, but falling short of a fully quantitative description. This work shows how such network models can be constructed and describes the global properties of the networks derived from such a model. These global properties are statistically robust and provide insights into the design of the underlying network. Results: Several whole-genome expression time series data sets from yeast microarray experiments were analyzed using a Markov-modeling method (Dewey and Galas, Func. Integr. Genomics, 1, 269–278, 2001) to infer an approximation to the underlying genetic network. We found that the global statistical properties of all the resulting networks are similar. The overall structure of these biological networks is distinctly different from that of other recently studied networks such as the Internet or social networks. These biological networks show hierarchical, hub-like structures that have some properties similar to a class of graphs known as small world graphs. Small world networks exhibit local cliquishness while exhibiting strong global connectivity. In addition to the small world properties, the biological networks show a power law or scale free distribution of connectivities. An inverse power law, N(k)∼k-3/2, for the number of vertices (genes) with k connections was observed for three different data sets from yeast. We propose network growth models based on gene duplication events. Simulations of these models yield networks with the same combination of global graphical properties that we inferred from the expression data. Contact: Ashish_Bhan@kgi.eduDavid_Galas@kgi.eduGreg_Dewey@kgi.edu Supplementary Information: http://www.kgi.edu/html/noncore/faculty/dewey/bioinf.pdf * 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
Ohno, S. (1970) · doi:10.1007/978-3-642-86659-3 · Cited by 7,833
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
A comprehensive two-hybrid analysis to explore the yeast protein interactome
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.061034498 · Cited by 3,566
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051 · cited 2×
“There has been considerable recent interest in the network structure of a diverse range of systems, including the Internet, communities of actors, scholarly citations, metabolic networks and ecological systems, among others (Jeong et al., 2000; Barabási and Albert, 1999; Albert and Barabási, 2001; Strogatz, 2001; Amar…”
Background
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
Evolution by gene duplication: An update
Zhang, J. (2003) · Trends in Ecology & Evolution · doi:10.1016/s0169-5347(03)00033-8 · Cited by 2,201
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
Coexpression Analysis of Human Genes Across Many Microarray Data Sets
Lee, H. K., Hsu, A. K., Sajdak, J., Qin, J., & Pavlidis, P. (2004) · Genome Research · doi:10.1101/gr.1910904 · Cited by 770
Loscalzo, J., Kohane, I., & Barabasi, A. (2007) · Molecular Systems Biology · doi:10.1038/msb4100163 · Cited by 603
Millan, M. J. (2006) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2005.11.006 · Cited by 551
Gene regulatory network growth by duplication
Teichmann, S. A., & Babu, M. M. (2004) · Nature Genetics · doi:10.1038/ng1340 · Cited by 510
Graph theory and networks in Biology
Mason, O., & Verwoerd, M. (2007) · IET Systems Biology · doi:10.1049/iet-syb:20060038 · Cited by 398
Vázquez, A., Dobrin, R., Sergi, D., Eckmann, J.-P., Oltvai, Z. N., & Barabási, A.-L. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0406024101 · Cited by 346
Duplication Models for Biological Networks
Chung, F., Lu, L., Dewey, T. G., & Galas, D. J. (2003) · Journal of Computational Biology · doi:10.1089/106652703322539024 · Cited by 322
Self-citationThe evolution of genetic networks by non-adaptive processes
Lynch, M. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2192 · Cited by 310
Luo, F., Yang, Y., Zhong, J., Gao, H., Khan, L., Thompson, D. K., & Zhou, J. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-299 · Cited by 298
Robustness and evolvability in genetic regulatory networks
Aldana, M., Balleza, E., Kauffman, S., & Resendiz, O. (2007) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2006.10.027 · Cited by 277
van Noort, V., Snel, B., & Huynen, M. A. (2004) · EMBO reports · doi:10.1038/sj.embor.7400090 · Cited by 256
The Powerful Law of the Power Law and Other Myths in Network Biology
Lima-Mendez, G., & van Helden, J. (2009) · Molecular BioSystems · doi:10.1039/b908681a · Cited by 210
Metadata
- Authors
- Bhan, A., Galas, D. J., & Dewey, T. G.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-11-01
- Volume
- 18
- Issue
- 11
- Pages
- 1486-1493
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2140827816
- Cited by
- 181
- References
- 4
- FWCI
- 4.10
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.