Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Letovsky, S.
Right arrow Articles by Kasif, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Letovsky, S.
Right arrow Articles by Kasif, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 Suppl. 1 2003
Pages i197-i204
© 2003 Oxford University Press

Predicting protein function from protein/protein interaction data: a probabilistic approach

Stanley Letovsky * and Simon Kasif

Bioinformatics Program and Department of Biomedical Engineering, Boston University, 44 Cummington St., Boston, MA 02215, USA

Received on January 6, 2003 ; accepted on February 20, 2003

Motivation:The development of experimental methods for genome scale analysis of molecular interaction networks has made possible new approaches to inferring protein function. This paper describes a method of assigning functions based on a probabilistic analysis of graph neighborhoods in a protein-protein interaction network. The method exploits the fact that graph neighbors are more likely to share functions than nodes which are not neighbors. A binomial model of local neighbor function labeling probability is combined with a Markov random field propagation algorithm to assign function probabilities for proteins in the network.

Results: We applied the method to a protein-protein interaction dataset for the yeast Saccharomyces cerevisiae using the Gene Ontology (GO) terms as function labels. The method reconstructed known GO term assignments with high precision, and produced putative GO assignments to 320 proteins that currently lack GO annotation, which represents about 10% of the unlabeled proteins in S. cerevisiae.

Availability: Source code available upon request. Results available athttp://genomics10.bu.edu/netmark

Contact: sletovsky{at}aol.com

Keywords: protein–protein interaction, protein function prediction, gene ontology, Markov Random fields

* 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
BioinformaticsHome page
M. F. Rogers and A. Ben-Hur
The use of gene ontology evidence codes in preventing classifier assessment bias
Bioinformatics, May 1, 2009; 25(9): 1173 - 1177.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
T.-t. Soong, K. O. Wrzeszczynski, and B. Rost
Physical protein-protein interactions predicted from microarrays
Bioinformatics, November 15, 2008; 24(22): 2608 - 2614.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
R. Singh, J. Xu, and B. Berger
Global alignment of multiple protein interaction networks with application to functional orthology detection
PNAS, September 2, 2008; 105(35): 12763 - 12768.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
S. Brohee, K. Faust, G. Lima-Mendez, O. Sand, R. Janky, G. Vanderstocken, Y. Deville, and J. van Helden
NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W444 - W451.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. N. Chua, W.-K. Sung, and L. Wong
An efficient strategy for extensive integration of diverse biological data for protein function prediction
Bioinformatics, December 15, 2007; 23(24): 3364 - 3373.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C. L. Myers and O. G. Troyanskaya
Context-sensitive data integration and prediction of biological networks
Bioinformatics, September 1, 2007; 23(17): 2322 - 2330.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Z. Wei and H. Li
A Markov random field model for network-based analysis of genomic data
Bioinformatics, June 15, 2007; 23(12): 1537 - 1544.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M.-H. Li, L. Lin, X.-L. Wang, and T. Liu
Protein protein interaction site prediction based on conditional random fields
Bioinformatics, March 1, 2007; 23(5): 597 - 604.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
S. Carroll and V. Pavlovic
Protein classification using probabilistic chain graphs and the Gene Ontology structure
Bioinformatics, August 1, 2006; 22(15): 1871 - 1878.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. N. Chua, W.-K. Sung, and L. Wong
Exploiting indirect neighbours and topological weight to predict protein function from protein-protein interactions
Bioinformatics, July 1, 2006; 22(13): 1623 - 1630.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
X. Wu, L. Zhu, J. Guo, D.-Y. Zhang, and K. Lin
Prediction of yeast protein-protein interaction network: insights from the Gene Ontology and annotations.
Nucleic Acids Res., January 1, 2006; 34(7): 2137 - 2150.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
J. Espadaler, R. Aragues, N. Eswar, M. A. Marti-Renom, E. Querol, F. X. Aviles, A. Sali, and B. Oliva
Detecting remotely related proteins by their interactions and sequence similarity
PNAS, May 17, 2005; 102(20): 7151 - 7156.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Leone and A. Pagnani
Predicting protein functions with message passing algorithms
Bioinformatics, January 15, 2005; 21(2): 239 - 247.
[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.