Skip Navigation


Bioinformatics Advance Access originally published online on February 2, 2006
Bioinformatics 2006 22(7):823-829; doi:10.1093/bioinformatics/btl014
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrowOA All Versions of this Article:
22/7/823    most recent
btl014v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 (21)
Google Scholar
Right arrow Articles by Yu, H.
Right arrow Articles by Gerstein, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Yu, H.
Right arrow Articles by Gerstein, M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions@oxfordjournals.org

Predicting interactions in protein networks by completing defective cliques

Haiyuan Yu {dagger}, Alberto Paccanaro {dagger}, Valery Trifonov 1,{dagger} and Mark Gerstein 1,*

Department of Molecular Biophysics and Biochemistry 266 Whitney Avenue Yale University PO Box 208114
1Department of Computer Science, Yale University New Haven, CT 06520-8285, USA

*To whom correspondence should be addressed.

Datasets obtained by large-scale, high-throughput methods for detecting protein–protein interactions typically suffer from a relatively high level of noise. We describe a novel method for improving the quality of these datasets by predicting missed protein–protein interactions, using only the topology of the protein interaction network observed by the large-scale experiment. The central idea of the method is to search the protein interaction network for defective cliques (nearly complete complexes of pairwise interacting proteins), and predict the interactions that complete them. We formulate an algorithm for applying this method to large-scale networks, and show that in practice it is efficient and has good predictive performance. More information can be found on our website http://topnet.gersteinlab.org/clique/

Contact: Mark.Gerstein{at}yale.edu

Supplementary information: Supplementary Materials are available at Bioinformatics online.


Received on April 14, 2005; revised on January 9, 2006; accepted on January 20, 2006

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
Sci SignalHome page
R. P. Alexander, P. M. Kim, T. Emonet, and M. B. Gerstein
Understanding Modularity in Molecular Networks Requires Dynamics
Sci. Signal., July 28, 2009; 2(81): pe44 - pe44.
[Abstract] [Full Text] [PDF]


Home page
Mol. Cell. ProteomicsHome page
H. Wang, B. Kakaradov, S. R. Collins, L. Karotki, D. Fiedler, M. Shales, K. M. Shokat, T. C. Walther, N. J. Krogan, and D. Koller
A Complex-based Reconstruction of the Saccharomyces cerevisiae Interactome
Mol. Cell. Proteomics, June 1, 2009; 8(6): 1361 - 1381.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
H. Chen, L. Ding, Z. Wu, T. Yu, L. Dhanapalan, and J. Y. Chen
Semantic web for integrated network analysis in biomedicine
Brief Bioinform, March 1, 2009; 10(2): 177 - 192.
[Abstract] [Full Text] [PDF]


Home page
J. Biol. Chem.Home page
A. Ma'ayan
Insights into the Organization of Biochemical Regulatory Networks Using Graph Theory Analyses
J. Biol. Chem., February 27, 2009; 284(9): 5451 - 5455.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Zampieri, N. Soranzo, and C. Altafini
Discerning static and causal interactions in genome-wide reverse engineering problems
Bioinformatics, July 1, 2008; 24(13): 1510 - 1515.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
B. Zhang, B.-H. Park, T. Karpinets, and N. F. Samatova
From pull-down data to protein interaction networks and complexes with biological relevance
Bioinformatics, April 1, 2008; 24(7): 979 - 986.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
A. Presser, M. B. Elowitz, M. Kellis, and R. Kishony
The evolutionary dynamics of the Saccharomyces cerevisiae protein interaction network after duplication
PNAS, January 22, 2008; 105(3): 950 - 954.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
K. Y. Yip, H. Yu, P. M. Kim, M. Schultz, and M. Gerstein
The tYNA platform for comparative interactomics: a web tool for managing, comparing and mining multiple networks
Bioinformatics, December 1, 2006; 22(23): 2968 - 2970.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
T. Aittokallio and B. Schwikowski
Graph-based methods for analysing networks in cell biology
Brief Bioinform, September 1, 2006; 7(3): 243 - 255.
[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.