Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (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 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 arrow Search for citing articles in:
ISI Web of Science (18)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tosatto, S. C.E.
Right arrow Articles by Männer, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Tosatto, S. C.E.
Right arrow Articles by Männer, R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Protein Engineering, Vol. 15, No. 4, 279-286, April 2002
© 2002 Oxford University Press

A divide and conquer approach to fast loop modeling

Silvio C.E. Tosatto,1,2, Eckart Bindewald, Jürgen Hesser and Reinhard Männer

Institute for Computational Medicine and Chair for Computer Science V, Universität Mannheim, B 6, 26, 68131 Mannheim, Germany

We describe a fast ab initio method for modeling local segments in protein structures. The algorithm is based on a divide and conquer approach and uses a database of precalculated look-up tables, which represent a large set of possible conformations for loop segments of variable length. The target loop is recursively decomposed until the resulting conformations are small enough to be compiled analytically. The algorithm, which is not restricted to any specific loop length, generates a ranked set of loop conformations in 20–180 s on a desktop PC. The prediction quality is evaluated in terms of global RMSD. Depending on loop length the top prediction varies between 1.06 Å RMSD for three-residue loops and 3.72 Å RMSD for eight-residue loops. Due to its speed the method may also be useful to generate alternative starting conformations for complex simulations.


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
N. Fernandez-Fuentes, B. Oliva, and A. Fiser
A supersecondary structure library and search algorithm for modeling loops in protein structures.
Nucleic Acids Res., January 1, 2006; 34(7): 2085 - 2097.
[Abstract] [Full Text] [PDF]

Home page
 Protein Eng Des SelHome page
E. Michalsky, A. Goede, and R. Preissner
Loops In Proteins (LIP)--a comprehensive loop database for homology modelling
Protein Eng. Des. Sel., December 1, 2003; 16(12): 979 - 985.
[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.