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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chin, C.-S.
Right arrow Articles by Samanta, M. P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Chin, C.-S.
Right arrow Articles by Samanta, M. P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 18 2003
pages 2413-2419
© 2003 Oxford University Press

Global snapshot of a protein interaction network—a percolation based approach

Chen-Shan Chin 1,* and Manoj Pratim Samanta 2

1 Department of Biochemistry and Biophysics, University of California, San Francisco, 94143 CA, USA and 2 NASA Advanced Supercomputing Division, NASA Ames Research Center, Moffet Field 94035 CA, USA

Received on March 25, 2003 ; revised on June 4, 2003 ; accepted on June 17, 2003

Motivation: Biologically significant information can be revealed by modeling large-scale protein interaction data using graph theory based network analysis techniques. However, the methods that are currently being used draw conclusions about the global features of the network from local connectivity data. A more systematic approach would be to define global quantities that measure (1) how strongly a protein ties with the other parts of the network and (2) how significantly an interaction contributes to the integrity of the network, and connect them with phenotype data from other sources. In this paper, we introduce such global connectivity measures and develop a stochastic algorithm based upon percolation in random graphs to compute them.

Results: We show that, in terms of global connectivities, the distribution of essential proteins is distinct from the background. This observation highlights a fundamental difference between the essential and the non-essential proteins in the network. We also find that the interaction data obtained from different experimental methods such as immunoprecipitation and two-hybrid techniques contribute differently to network integrities. Such difference between different experimental methods can provide insight into the systematic bias present among these techniques.

Supplementary information: The full list of our results can be found in the supplemental web site http://www.nas.nasa.gov/Groups/SciTech/nano/msamanta/projects/percolation/index.php

Contact: cschin{at}genome.ucsf.edu

* 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
Nucleic Acids ResHome page
C.-Y. Lin, C.-H. Chin, H.-H. Wu, S.-H. Chen, C.-W. Ho, and M.-T. Ko
Hubba: hub objects analyzer--a framework of interactome hubs identification for network biology
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W438 - W443.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
L. Ferrarini, L. Bertelli, J. Feala, A. D. McCulloch, and G. Paternostro
A more efficient search strategy for aging genes based on connectivity
Bioinformatics, February 1, 2005; 21(3): 338 - 348.
[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.