Skip Navigation

Nucleic Acids Research 2006 34(Web Server issue):W315-W319; doi:10.1093/nar/gkl112
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (844K) Freely available
Right arrow Screen PDF (224K) 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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Izarzugaza, J. M. G.
Right arrow Articles by Pazos, F.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Izarzugaza, J. M. G.
Right arrow Articles by Pazos, F.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions@oxfordjournals.org


Article

TSEMA: interactive prediction of protein pairings between interacting families

José M. G. Izarzugaza, David Juan, Carles Pons1, Juan A. G. Ranea2, Alfonso Valencia1 and Florencio Pazos*

National Center for Biotechnology (CNB-CSIC) C/Darwin, 3 Cantoblanco, 28049 Madrid, Spain 1 National Bioinformatics Institute (INB), Barcelona Supercomputer Centre C/Jordi Girona, 29 08034 Barcelona, Spain 2 Department of Biochemistry and Molecular Biology, Biomolecular Structure and Modelling Unit, University College London London WC1E 6BT, UK

*To whom correspondence should be addressed. Tel: +34 915854669; Fax: +34 915854506; Email: pazos{at}cnb.uam.es

Received February 13, 2006. Revised March 1, 2006. Accepted March 9, 2006.

An entire family of methodologies for predicting protein interactions is based on the observed fact that families of interacting proteins tend to have similar phylogenetic trees due to co-evolution. One application of this concept is the prediction of the mapping between the members of two interacting protein families (which protein within one family interacts with which protein within the other). The idea is that the real mapping would be the one maximizing the similarity between the trees. Since the exhaustive exploration of all possible mappings is not feasible for large families, current approaches use heuristic techniques which do not ensure the best solution to be found. This is why it is important to check the results proposed by heuristic techniques and to manually explore other solutions. Here we present TSEMA, the server for efficient mapping assessment. This system calculates an initial mapping between two families of proteins based on a Monte Carlo approach and allows the user to interactively modify it based on performance figures and/or specific biological knowledge. All the explored mappings are graphically shown over a representation of the phylogenetic trees. The system is freely available at http://pdg.cnb.uam.es/TSEMA. Standalone versions of the software behind the interface are available upon request from the authors.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




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.