Skip Navigation


Bioinformatics Advance Access originally published online on March 16, 2009
Bioinformatics 2009 25(10):1264-1270; doi:10.1093/bioinformatics/btp149
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow Supplementary Data
Right arrow Supplementary Data
Right arrow All Versions of this Article:
25/10/1264    most recent
btp149v1
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 Björkholm, P.
Right arrow Articles by Hvidsten, T. R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Björkholm, P.
Right arrow Articles by Hvidsten, T. R.
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

Using multi-data hidden Markov models trained on local neighborhoods of protein structure to predict residue–residue contacts

Patrik Björkholm 1,2, Pawel Daniluk 3, Andriy Kryshtafovych 4, Krzysztof Fidelis 4, Robin Andersson 1 and Torgeir R. Hvidsten 1,5,*

1The Linnaeus Centre for Bioinformatics, Uppsala University, Uppsala, 2Stockholm Bioinformatics Center, Albanova, Stockholm University, 10691 Stockholm, Sweden, 3Department of Biophysics, Faculty of Physics, University of Warsaw, Warsaw, Poland, 4UC Davis Genome Centre, UC Davis, USA and 5Umeå Plant Science Centre, Department of Plant Physiology, Umeå University, Umeå, Sweden

*To whom correspondence should be addressed.


   Abstract

Motivation:Correct prediction of residue–residue contacts in proteins that lack good templates with known structure would take ab initio protein structure prediction a large step forward. The lack of correct contacts, and in particular long-range contacts, is considered the main reason why these methods often fail.

Results: We propose a novel hidden Markov model (HMM)-based method for predicting residue–residue contacts from protein sequences using as training data homologous sequences, predicted secondary structure and a library of local neighborhoods (local descriptors of protein structure). The library consists of recurring structural entities incorporating short-, medium- and long-range interactions and is general enough to reassemble the cores of nearly all proteins in the PDB. The method is tested on an external test set of 606 domains with no significant sequence similarity to the training set as well as 151 domains with SCOP folds not present in the training set. Considering the top 0.2 · L predictions (L=sequence length), our HMMs obtained an accuracy of 22.8% for long-range interactions in new fold targets, and an average accuracy of 28.6% for long-, medium- and short-range contacts. This is a significant performance increase over currently available methods when comparing against results published in the literature.

Availability: http://predictioncenter.org/Services/FragHMMent/

Contact: torgeir.hvidsten{at}plantphys.umu.se

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Anna Tramontano


Received on October 9, 2008; revised on February 24, 2009; accepted on March 14, 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.