Skip Navigation



Bioinformatics Advance Access published online on September 17, 2004

Bioinformatics, doi:10.1093/bioinformatics/bth491
Bioinformatics © Oxford University Press 2004; all rights reserved
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/2/239    most recent
bth491v1
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 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 Leone, M.
Right arrow Articles by Pagnani, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Leone, M.
Right arrow Articles by Pagnani, A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Received May 7, 2004
Revised July 1, 2004
Accepted August 16, 2004

Article

Predicting protein functions with message passing algorithms

Michele Leone 1* and Andrea Pagnani 1

1 Institute for Scientific Interchange (ISI), Viale Settimio Severo 65, Turin, I-10133, Italy

* To whom correspondence should be addressed. E-mail: leone{at}isiosf.isi.it.


   Abstract

Motivations: In the last few years a growing interest in biology has been shifting toward the problem of optimal information extraction from the huge amount of data generated via large scale and high-throughput techniques. One of the most relevant issues has recently become that of correctly and reliably predicting the functions of a given protein with of functions exploiting information coming from the whole network of proteins physically interacting with the functionally undetermined one (Hodgman, 2000). In the present work we will refer to an "observed" protein as one present in protein-protein interaction networks published in the literature as i. e. in (Uetz and et al., 2000; Xenarios and et al., 2000; Giot and et al., 2003).

Methods: The method proposed in this article is based on a message passing algorithm known as Belief Propagation (Yedidia et al., 2003), which takes as input the network of proteins physical interactions and a catalog of known proteins functions, and returns the probabilities for each unclassified protein of having one chosen function. The implementation of the algorithm allows for fast on-line analysis, and can be easily generalized to more complex graph topologies taking into account hyper-graphs, i.e. complexes of more than two interacting proteins.

Results: Benchmarks of our method are two Saccharomyces cerevisiæ protein-protein interaction networks (PPI) as in (Uetz and et al., 2000) and in the Database of Interacting Proteins (DIP). The validity of our approach is successfully tested against other available techniques (Deng and et al., 2002; Letovsky and Kasif, 2003; Vazquez et al., 2003).


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
Genome Res.Home page
T. Ideker and R. Sharan
Protein networks in disease
Genome Res., April 1, 2008; 18(4): 644 - 652.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafe, A. Perez, et al.
Machine learning in bioinformatics
Brief Bioinform, March 1, 2006; 7(1): 86 - 112.
[Abstract] [Full Text] [PDF]


Home page
Genome Res.Home page
S. Bandyopadhyay, R. Sharan, and T. Ideker
Systematic identification of functional orthologs based on protein network comparison
Genome Res., March 1, 2006; 16(3): 428 - 435.
[Abstract] [Full Text] [PDF]


Home page
Genome Res.Home page
S. Bandyopadhyay, R. Sharan, and T. Ideker
Systematic identification of functional orthologs based on protein network comparison
Genome Res., March 1, 2006; 16(3): 428 - 435.
[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.