Skip Navigation


Bioinformatics Advance Access originally published online on September 7, 2007
Bioinformatics 2007 23(21):2836-2842; doi:10.1093/bioinformatics/btm456
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary data
Right arrow All Versions of this Article:
23/21/2836    most recent
btm456v1
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Peng, H.-P.
Right arrow Articles by Yang, A.-S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Peng, H.-P.
Right arrow Articles by Yang, A.-S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Modeling protein loops with knowledge-based prediction of sequence-structure alignment

Hung-Pin Peng and An-Suei Yang *

Genomics Research Center, Academia Sinica. 128 Academia Road, Section 2, Nankang District, Taipei 115, Taiwan, R.O.C.

*To whom correspondence should be addressed.


   Abstract

Motivation: As protein structure database expands, protein loop modeling remains an important and yet challenging problem. Knowledge-based protein loop prediction methods have met with two challenges in methodology development: (1) loop boundaries in protein structures are frequently problematic in constructing length-dependent loop databases for protein loop predictions; (2) knowledge-based modeling of loops of unknown structure requires both aligning a query loop sequence to loop templates and ranking the loop sequence-template matches.

Results: We developed a knowledge-based loop prediction method that circumvents the need of constructing hierarchically clustered length-dependent loop libraries. The method first predicts local structural fragments of a query loop sequence and then structurally aligns the predicted structural fragments to a set of non-redundant loop structural templates regardless of the loop length. The sequence-template alignments are then quantitatively evaluated with an artificial neural network model trained on a set of predictions with known outcomes. Prediction accuracy benchmarks indicated that the novel procedure provided an alternative approach overcoming the challenges of knowledge-based loop prediction.

Availability: http://cmb.genomics.sinica.edu.tw

Contact: yangas{at}gate.sinica.edu.tw

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Alfonso Valencia


Received on July 4, 2007; revised on August 16, 2007; accepted on August 23, 2007

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
Nucleic Acids ResHome page
P. W. Hildebrand, A. Goede, R. A. Bauer, B. Gruening, J. Ismer, E. Michalsky, and R. Preissner
SuperLooper--a prediction server for the modeling of loops in globular and membrane proteins
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W571 - W574.
[Abstract] [Full Text] [PDF]


Home page
Protein Eng Des SelHome page
M. Cui, M. Mezei, and R. Osman
Prediction of protein loop structures using a local move Monte Carlo approach and a grid-based force field
Protein Eng. Des. Sel., December 1, 2008; 21(12): 729 - 735.
[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.