Gene network: Model, dynamics and simulation

7Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A gene network is modeled as a dynamical random graph whose vertices and edges represent genes and gene-gene interactions, respectively. The network grows through three biological mechanisms: (1) gene duplication and loss; (2) gene-gene interaction adding and removing; and (3) genome duplication. The evolutionary dynamics of gene networks is discussed. It is shown that: (1) the vertex degree distribution (i.e., the distribution of the number of the gene-gene interactions per gene) always follows power laws and the power law exponents may be changed by genome duplications; and (2) the network degree distribution (i.e., the distribution of the total number of the gene-gene interactions in the network) has a complex behavior: If no genome duplication occurs, it follows a power law. If a genome duplication occurs, it may be away from the power law state. However, after a sufficient long evolutionary time, it approaches to a power law tail. The dynamics is confirmed by computer simulations. By allowing genome duplications, our model and dynamics (describing the dynamic behavior of gene networks) are more realistic than other previous ones (containing only static behavior). © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wu, S., & Gu, X. (2005). Gene network: Model, dynamics and simulation. In Lecture Notes in Computer Science (Vol. 3595, pp. 12–21). Springer Verlag. https://doi.org/10.1007/11533719_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free