Skip Navigation


Bioinformatics Advance Access originally published online on September 17, 2004
Bioinformatics 2005 21(2):239-247; doi:10.1093/bioinformatics/bth491
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print 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 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 (7)
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?

Bioinformatics vol. 21 issue 2 © Oxford University Press 2005; all rights reserved.

Predicting protein functions with message passing algorithms

Michele Leone * and Andrea Pagnani

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

*To whom correspondence should be addressed.

Motivation: 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 emerged that of correctly and reliably predicting the functions of a given protein with that of functions exploiting information coming from the whole network of proteins physically interacting with the functionally undetermined one. In the present work, we will refer to an ‘observed’ protein as the one present in the protein–protein interaction networks published in the literature.

Methods: The method proposed in this paper is based on a message passing algorithm known as Belief Propagation, which accepts the network of protein's physical interactions and a catalog of known protein's functions as input, and returns the probabilities for each unclassified protein of having one chosen function. The implementation of the algorithm allows for fast online analysis, and can easily be generalized into more complex graph topologies taking into account hypergraphs, i.e. complexes of more than two interacting proteins.

Results: Benchmarks of our method are the two Saccharomyces cerevisiae protein–protein interaction networks and the Database of Interacting Proteins. The validity of our approach is successfully tested against other available techniques.

Contact: leone{at}isiosf.isi.it

Supplementary information: http://isiosf.isi.it/~pagnani


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 ResHome 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 ResHome 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 ResHome 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.