Skip Navigation

Bioinformatics 2005 21(Suppl 1):i241-i250; doi:10.1093/bioinformatics/bti1009
This Article
Right arrow FREE Full Text (Print PDF) Freely available
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 Jothi, R.
Right arrow Articles by Przytycka, T. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Jothi, R.
Right arrow Articles by Przytycka, T. M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Predicting protein–protein interaction by searching evolutionary tree automorphism space

Raja Jothi , Maricel G. Kann and Teresa M. Przytycka *

National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health Bethesda, MD 20894, USA

*To whom correspondence should be addressed.

Motivation: Uncovering the protein–protein interaction network is a fundamental step in the quest to understand the molecular machinery of a cell. This motivates the search for efficient computational methods for predicting such interactions. Among the available predictors are those that are based on the co-evolution hypothesis "evolutionary trees of protein families (that are known to interact) are expected to have similar topologies". Many of these methods are limited by the fact that they can handle only a small number of protein sequences. Also, details on evolutionary tree topology are missing as they use similarity matrices in lieu of the trees.

Results: We introduce MORPH, a new algorithm for predicting protein interaction partners between members of two protein families that are known to interact. Our approach can also be seen as a new method for searching the best superposition of the corresponding evolutionary trees based on tree automorphism group. We discuss relevant facts related to the predictability of protein–protein interaction based on their co-evolution. When compared with related computational approaches, our method reduces the search space by ~3 x 105-fold and at the same time increases the accuracy of predicting correct binding partners.

Contact: przytyck{at}mail.nih.gov


Received on January 15, 2005; accepted on March 27, 2005

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
Ann. N. Y. Acad. Sci.Home page
R. A. CRAIG and L. LIAO
Improving Protein Protein Interaction Prediction Based on Phylogenetic Information Using a Least-Squares Support Vector Machine
Ann. N.Y. Acad. Sci., December 1, 2007; 1115(1): 154 - 167.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
M. G. Kann
Protein interactions and disease: computational approaches to uncover the etiology of diseases
Brief Bioinform, September 1, 2007; 8(5): 333 - 346.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
J. M. G. Izarzugaza, D. Juan, C. Pons, J. A. G. Ranea, A. Valencia, and F. Pazos
TSEMA: interactive prediction of protein pairings between interacting families.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W315 - W319.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. Jothi, E. Zotenko, A. Tasneem, and T. M. Przytycka
COCO-CL: hierarchical clustering of homology relations based on evolutionary correlations
Bioinformatics, April 1, 2006; 22(7): 779 - 788.
[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.