Fast and accurate methods for predicting short-range constraints in protein models.
Protein modeling tools utilize many kinds of structural information that may be predicted from amino acid sequence of a target protein or obtained from experiments. Such data provide geometrical constraints in a modeling process. The main aim is to generate the best possible consensus structure. The quality of models strictly depends on the imposed conditions. In this work we present an algorithm, which predicts short-range distances between Calpha atoms as well as a set of short structural fragments that possibly share structural similarity with a query sequence. The only input of the method is a query sequence profile. The algorithm searches for short protein fragments with high sequence similarity. As a result a statistics of distances observed in the similar fragments is returned. The method can be used also as a scoring function or a short-range knowledge-based potential based on the computed statistics.
Gront
Dominik
D
Faculty of Chemistry, University of Warsaw, Warsaw, Poland. dgront@chem.uw.edu.pl
Kolinski
Andrzej
A
D000465:Algorithms; D000595:Amino Acid Sequence; D008958:Models, Molecular; D008969:Molecular Sequence Data; D011237:Predictive Value of Tests; D011506:Proteins / Q000737:chemistry* / Q000235:genetics / Q000378:metabolism; D020539:Sequence Analysis, Protein; D012984:Software
D011506:Proteins