The Yeast Protein Interaction Network Evolves Rapidly and Contains Few Redundant Duplicate Genes
AbstractThe structure and evolution of the protein interaction network of the yeast Saccharomyces cerevisiae is analyzed. The network is viewed as a graph whose nodes correspond to proteins. Two proteins are connected by an edge if they interact. The network resembles a random graph, in that it consists of many small subnets, groups of proteins that interact with each other but do not interact with any other protein, and one large connected subnet comprising more than half of all interacting proteins. The number of interactions per protein appears to follow a power-law distribution. Within approximately 200 million years after a duplication, the products of duplicate genes become almost equally likely to (i) have common protein interaction partners, and (ii) be part of the same sub-network, as two proteins chosen at random from within the network. This indicates that the persistence of redundant interaction partners is the exception rather than the rule. After gene duplication, the likelihood that an interaction gets lost exceeds 2.2x10-3 per million years. New interactions are estimated to evolve at rate that is approximately three orders of magnitude smaller. Every 300 million years, as many as half of all interactions may become replaced by new interactions.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Santa Fe Institute in its series Working Papers with number 01-04-022.
Date of creation: Apr 2001
Date of revision:
Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Andreas Wagner & David Fell, 2000. "The Small World Inside Large Metabolic Networks," Working Papers 00-07-041, Santa Fe Institute.
- Colizza, Vittoria & Flammini, Alessandro & Maritan, Amos & Vespignani, Alessandro, 2005. "Characterization and modeling of protein–protein interaction networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 352(1), pages 1-27.
- How to Reconstruct a Large Genetic Network from n Gene Perturbations in Fewer than n2 Easy Steps, 2001. "How to Reconstruct a Large Genetic Network from," Working Papers 01-09-047, Santa Fe Institute.
- Cárdenas, J.P. & Mouronte, M.L. & Benito, R.M. & Losada, J.C., 2010. "Compatibility as underlying mechanism behind the evolution of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(8), pages 1789-1798.
- Wylie, Dennis Cates, 2009. "Linked by loops: Network structure and switch integration in complex dynamical systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(9), pages 1946-1958.
- Sun, Lanfang & Jiang, Lu & Li, Menghui & He, Dacheng, 2006. "Statistical analysis of gene regulatory networks reconstructed from gene expression data of lung cancer," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 370(2), pages 663-671.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.