Skip Navigation


Bioinformatics Advance Access originally published online on April 17, 2009
Bioinformatics 2009 25(13):1632-1639; doi:10.1093/bioinformatics/btp264
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow Supplementary Data
Right arrow All Versions of this Article:
25/13/1632    most recent
btp264v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Schillinger, C.
Right arrow Articles by Krause, G.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Schillinger, C.
Right arrow Articles by Krause, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Domain Interaction Footprint: a multi-classification approach to predict domain–peptide interactions

Christian Schillinger 1,2, Prisca Boisguerin 3 and Gerd Krause 1,*

1Leibniz Institute for Molecular Pharmacology, Robert-Roessle-Str. 10, Berlin, 2FU-Berlin, Department of Biology, Chemistry and Pharmacy, Takustr. 3, 14195 Berlin and 3Institute of Medical Immunology, Charite-Universitaetsmedizin, Hessischestrasse 3-4, 10115 Berlin, Germany

*To whom correspondence should be addressed.


   Abstract

Motivation: The flow of information within cellular pathways largely relies on specific protein–protein interactions. Discovering such interactions that are mostly mediated by peptide recognition modules (PRM) is therefore a fundamental step towards unravelling the complexity of varying pathways. Since peptides can be recognized by more than one PRM and high-throughput experiments are both time consuming and expensive, it would be preferable to narrow down all potential peptide ligands for one specific PRM by a computational method. We at first present Domain Interaction Footprint (DIF) a new approach to predict binding peptides to PRMs merely based on the sequence of the peptides. Second, we show that our method is able to create a multi-classification model that assesses the binding specificity of a given peptide to all examined PRMs at once.

Results: We first applied our approach to a previously investigated dataset of different SH3 domains and predicted their appropriate peptide ligands with an exceptionally high accuracy. This result outperforms all recent methods trained on the same dataset. Furthermore, we used our technique to build two multi-classification models (SH3 and PDZ domains) to predict the interaction preference between a peptide and every single domain in the corresponding domain family at once. Predicting the domain specificity most reliably, our proposed approach can be seen as a first step towards a complete multi-domain classification model comprised of all domains of one family. Such a comprehensive domain specificity model would benefit the quest for highly specific peptide ligands interacting solely with the domain of choice.

Contact: gkrause{at}fmp-berlin.de

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Burkhard Rost


Received on October 7, 2008; revised on April 1, 2009; accepted on April 15, 2009

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.