Open AccessAutomated main‐chain model building by template matching and iterative fragment extension
Author(s) -
Terwilliger Thomas C.
Publication year - 2003
Publication title -
acta crystallographica section d
Language(s) - English
Resource type - Journals
ISSN - 1399-0047
DOI - 10.1107/s0907444902018036
Subject(s) - fragment (logic) , chain (unit) , matching (statistics) , computer science , extension (predicate logic) , algorithm , basis (linear algebra) , biological system , computational biology , mathematics , geometry , physics , biology , programming language , statistics , astronomy
An algorithm for the automated macromolecular model building of polypeptide backbones is described. The procedure is hierarchical. In the initial stages, many overlapping polypeptide fragments are built. In subsequent stages, the fragments are extended and then connected. Identification of the locations of helical and β‐strand regions is carried out by FFT‐based template matching. Fragment libraries of helices and β‐strands from refined protein structures are then positioned at the potential locations of helices and strands and the longest segments that fit the electron‐density map are chosen. The helices and strands are then extended using fragment libraries consisting of sequences three amino acids long derived from refined protein structures. The resulting segments of polypeptide chain are then connected by choosing those which overlap at two or more C α positions. The fully automated procedure has been implemented in RESOLVE and is capable of model building at resolutions as low as 3.5 Å. The algorithm is useful for building a preliminary main‐chain model that can serve as a basis for refinement and side‐chain addition.