Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (52)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bhan, A.
Right arrow Articles by Dewey, T. G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bhan, A.
Right arrow Articles by Dewey, T. G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 11 2002
Pages 1486-1493
© 2002 Oxford University Press

A duplication growth model of gene expression networks

Ashish Bhan , David J. Galas and T. Gregory Dewey *

Keck Graduate Institute of Applied Life Sciences, 535 Watson Drive, Claremont, CA 91711, USA

Received on December 13, 2001 ; revised on February 8, 2002 and April 29, 2002 ; accepted on May 3, 2002

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{at}kgi.edu David_Galas{at}kgi.edu Greg_Dewey{at}kgi.edu

Supplementary Information: http://www.kgi.edu/html/noncore/faculty/dewey/bioinf.pdf

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Mol Cancer ResHome page
K. L. Streicher, N. E. Willmarth, J. Garcia, J. L. Boerner, T. G. Dewey, and S. P. Ethier
Activation of a Nuclear Factor {kappa}B/Interleukin-1 Positive Feedback Loop by Amphiregulin in Human Breast Cancer Cells
Mol. Cancer Res., August 1, 2007; 5(8): 847 - 861.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
R. M. D'Souza, C. Borgs, J. T. Chayes, N. Berger, and R. D. Kleinberg
From the Cover: Emergence of tempered preferential attachment from optimization
PNAS, April 10, 2007; 104(15): 6112 - 6117.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Y. Louzoun, L. Muchnik, and S. Solomon
Copying nodes versus editing links: the source of the difference between genetic regulatory networks and the WWW
Bioinformatics, March 1, 2006; 22(5): 581 - 588.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
M. Middendorf, E. Ziv, and C. H. Wiggins
From The Cover: Inferring network mechanisms: The Drosophila melanogaster protein interaction network
PNAS, March 1, 2005; 102(9): 3192 - 3197.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
Z. Zhang, Z. W. Luo, H. Kishino, and M. J. Kearsey
Divergence Pattern of Duplicate Genes in Protein-Protein Interactions Follows the Power Law
Mol. Biol. Evol., March 1, 2005; 22(3): 501 - 505.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
A. Vazquez, R. Dobrin, D. Sergi, J.-P. Eckmann, Z. N. Oltvai, and A.-L. Barabasi
The topological relationship between the large-scale attributes and local interaction patterns of complex networks
PNAS, December 28, 2004; 101(52): 17940 - 17945.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
I. K. Jordan, L. Marino-Ramirez, Y. I. Wolf, and E. V. Koonin
Conservation and Coevolution in the Scale-Free Human Gene Coexpression Network
Mol. Biol. Evol., November 1, 2004; 21(11): 2058 - 2070.
[Abstract] [Full Text] [PDF]


Home page
Genome Res.Home page
H. K. Lee, A. K. Hsu, J. Sajdak, J. Qin, and P. Pavlidis
Coexpression Analysis of Human Genes Across Many Microarray Data Sets
Genome Res., June 1, 2004; 14(6): 1085 - 1094.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.