Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps
1Computer Science Department, Princeton University Princeton, NJ 08544, USA
2Lewis-Sigler Institute for Integrative Genomics, Princeton University Princeton, NJ 08544, USA
*To whom correspondence should be addressed.
Motivation: Determining protein function is one of the most important problems in the post-genomic era. For the typical proteome, there are no functional annotations for one-third or more of its proteins. Recent high-throughput experiments have determined proteome-scale protein physical interaction maps for several organisms. These physical interactions are complemented by an abundance of data about other types of functional relationships between proteins, including genetic interactions, knowledge about co-expression and shared evolutionary history. Taken together, these pairwise linkages can be used to build whole-proteome protein interaction maps.
Results: We develop a network-flow based algorithm, FunctionalFlow, that exploits the underlying structure of protein interaction maps in order to predict protein function. In cross-validation testing on the yeast proteome, we show that FunctionalFlow has improved performance over previous methods in predicting the function of proteins with few (or no) annotated protein neighbors. By comparing several methods that use protein interaction maps to predict protein function, we demonstrate that FunctionalFlow performs well because it takes advantage of both network topology and some measure of locality. Finally, we show that performance can be improved substantially as we consider multiple data sources and use them to create weighted interaction networks.
Availability: http://compbio.cs.princeton.edu/function
Contact: msingh{at}princeton.edu
Received on January 15, 2005; accepted on March 27, 2005
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  J. Song and M. Singh How and when should interactome-derived clusters be used to predict functional modules and protein function? Bioinformatics, December 1, 2009; 25(23): 3143 - 3150. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
C. Huttenhower, M. A. Hibbs, C. L. Myers, A. A. Caudy, D. C. Hess, and O. G. Troyanskaya The impact of incomplete knowledge on evaluation: an experimental benchmark for protein function prediction Bioinformatics, September 15, 2009; 25(18): 2404 - 2410. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 J. S. Bader New Connections, New Components, Real Dynamics Sci. Signal., August 4, 2009; 2(82): pe48 - pe48. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 R. Llewellyn and D. S. Eisenberg Annotating proteins with generalized functional linkages PNAS, November 18, 2008; 105(46): 17700 - 17705. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
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]
|
|
|
|
|
|
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]
|
|
|
|
 |
|
 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]
|
|
|
|
 |
|
 N. Massjouni, C. G. Rivera, and T. M. Murali VIRGO: computational prediction of gene functions. Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W340 - W344. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
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]
|
|