Abstract
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 Cα 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.
Similar content being viewed by others
References
Plewczynska D, Kolinski A (2005) Macromol Theory Simul 14:444
Tramontano A (2003) Comp Funct Genomics 4:402
Pieper U, Eswar N, Braberg H, Madhusudhan MS, Davis FP, Stuart AC, Mirkovic N, Rossi A, Marti-Renom MA, Fiser A, Webb B, Greenblatt D, Huang CC, Ferrin TE, Sali A (2004) Nucleic Acids Res 32:D217
Kopp J, Schwede T (2004) Nucleic Acids Res 32:D230
Marti-Renom MA, Stuart AC, Fiser A, Sanchez R, Melo F, Sali A (2000) Annu Rev Biophys Biomol Struct 29:291
Goebel U, Sander C, Schneider R, Valencia A (1994) Proteins 18:309
Punta M, Rost B (2005) Bioinformatics 21:2960
Cuff JA, Clamp ME, Siddiqui AS, Finlay M, Barton GJ (1998) Bioinformatics 14:892
Jones DT (1999) J Mol Biol 292:195
Rost B (2001) J Struct Biol 134:204
de Brevern AG, Etchebest C, Hazout S (2000) Proteins 41:271
Fetrow JS, Palumbo MJ, Berg G (1997) Proteins 27:249
Bystroff C, Baker D (1998) J Mol Biol 281:565
Rohl CA, Strauss CE, Misura KM, Baker D (2004) Methods Enzymol 383:66
Gront D, Kolinski A (2005) Bioinformatics 21:981
Gront D, Kolinski A (2006) Bioinformatics 22:621
Gront D, Kolinski A (2008) Bioinformatics 24:584
Gribskov M, McLachlan AD, Eisenberg D (1987) Proc Natl Acad Sci USA 84:4355
Sadreyev R, Grishin N (2003) J Mol Biol 326:317
Ohlson T, Wallner B, Elofsson A (2004) Proteins 57:188
Prlic A, Domingues FS, Sippl MJ (2000) Protein Eng 13:545
Kolinski A (2004) Acta Biochim Pol 51:349
Dragalin V, Fedorov V, Patterson S, Jones B (2003) Stat Med 22:913
Davis JV, Dhillon I (2006) Adv Neural Inform Process Syst 19:89
Kmiecik S, Kurcinski M, Rutkowska A, Gront D, Kolinski A (2005) Acta Biochim Pol 53:131
Wang G, Dunbrack RLJ (2003) Bioinformatics 19:1589
Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ (1997) Nucleic Acids Res 25:3389
Kabsch W, Sander C (1983) Biopolymers 22:2577
Bradley P, Malmstrom L, Qian B, Schonbrun J, Chivian D, Kim DEE, Meiler J, Misura KMSM, Baker D (2005) Proteins 61:124
Kolinski A, Bujnicki JM (2005) Proteins 61:84
Moult J, Fidelis K, Rost B, Hubbard T, Tramontano A (2005) Proteins 61:3
Acknowledgement
This work was partially supported from NIH grant 1R01GM081680-01.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gront, D., Kolinski, A. Fast and accurate methods for predicting short-range constraints in protein models. J Comput Aided Mol Des 22, 783–788 (2008). https://doi.org/10.1007/s10822-008-9213-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10822-008-9213-8