An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps

  • Stefano Teso
  • Cristina Di Risio
  • Andrea Passerini
  • Roberto Battiti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6282)

Abstract

An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional structure for a given protein given only its amino acid sequence. The PSP problem is of enormous interest, because the function of proteins is a direct consequence of their three-dimensional structure. Approaches to solve the PSP use protein models that range from very realistic (all-atom) to very simple (on a lattice). Finer representations usually generate better candidate structures, but are computationally more costly than the simpler on-lattice ones. In this work we propose a combined approach that makes use of a simple and fast lattice protein structure prediction algorithm, REMC-HPPFP, to compute a number of coarse candidate structures. These are later refined by 3Distill, an off-lattice, residue-level protein structure predictor. We prove that the lattice algorithm is able to bootstrap 3Distill, which consequently converges much faster, allowing for shorter execution times without noticeably degrading the quality of the predictions. This novel method allows us to generate a large set of decoys of quality comparable to those computed by the off-lattice method alone, but using a fraction of the computations. As a result, our method could be used to build large databases of predicted decoys for analysis, or for selecting the best candidate structures through reranking techniques. Furthermore our method is generic, in that it can be applied to other algorithms than 3Distill.

Keywords

Protein Structure Prediction HP model Contact Maps Simulated Annealing Replica Exchange Monte Carlo 

References

  1. 1.
    Baú, D., Martin, A.J.M., Mooney, C., Vullo, A., Walsh, I., Pollastri, G.: Distill: a suite of web servers for the prediction of one-, two- and three-dimensional structural features of proteins. BMC bioinformatics 7(1), 402 (2006)CrossRefPubMedPubMedCentralGoogle Scholar
  2. 2.
    Cheng, J., Baldi, P.: Improved residue contact prediction using support vector machines and a large feature set. BMC bioinformatics 8(1), 113 (2007)CrossRefPubMedPubMedCentralGoogle Scholar
  3. 3.
    Dill, K.A.: Theory for the folding and stability of globular proteins. Biochemistry 24(6), 1501–1509 (1985)CrossRefPubMedGoogle Scholar
  4. 4.
    Garavito, R.M., Picot, D., Loll, P.J.: Strategies for crystallizing membrane proteins. Journal of bioenergetics and biomembranes 28(1), 13–27 (1996)CrossRefPubMedGoogle Scholar
  5. 5.
    Hsu, H.P., Mehra, V., Nadler, W., Grassberger, P.: Growth-based optimization algorithm for lattice heteropolymers. Physical Review E 68(2), 21113 (2003)CrossRefGoogle Scholar
  6. 6.
    Kaczanowski, S., Zielenkiewicz, P.: Why similar protein sequences encode similar three-dimensional structures? Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta)Google Scholar
  7. 7.
    Kirkpatrick, S.: Optimization by simulated annealing: Quantitative studies. Journal of Statistical Physics 34(5), 975–986 (1984)CrossRefGoogle Scholar
  8. 8.
    Kryshtafovych, A., Venclovas, C., Fidelis, K., Moult, J.: Progress over the first decade of CASP experiments. Proteins: Structure, Function, and Bioinformatics 61(S7), 225–236 (2005)CrossRefGoogle Scholar
  9. 9.
    Lesh, N., Mitzenmacher, M., Whitesides, S.: A complete and effective move set for simplified protein folding. In: Proceedings of the seventh annual international conference on Research in computational molecular biology, p. 195. ACM, New York (2003)Google Scholar
  10. 10.
    Oakley, M.T., Barthel, D., Bykov, Y., Garibaldi, J.M., Burke, E.K., Krasnogor, N., Hirst, J.D.: Search strategies in structural bioinformatics. Current Protein and Peptide Science 9(3), 260–274 (2008)CrossRefPubMedGoogle Scholar
  11. 11.
    Pierri, C.L., De Grassi, A., Turi, A.: Lattices for ab initio protein structure prediction. Proteins: Structure, Function, and Bioinformatics 73(2), 351–361 (2008)CrossRefGoogle Scholar
  12. 12.
    Rohl, C.A., Strauss, C.E.M., Misura, K., Baker, D.: Protein structure prediction using Rosetta. Methods in enzymology, 66–93 (2004)Google Scholar
  13. 13.
    Shmygelska, A., Hoos, H.H.: An ant colony optimisation algorithm for the 2 D and 3 D hydrophobic polar protein folding problem. BMC bioinformatics 6(1), 30 (2005)CrossRefPubMedPubMedCentralGoogle Scholar
  14. 14.
    Tegge, A.N., Wang, Z., Eickholt, J., Cheng, J.: NNcon: Improved Protein Contact Map Prediction Using 2D-Recursive Neural Networks. Nucleic Acids Research (May 2009)Google Scholar
  15. 15.
    Thachuk, C., Shmygelska, A., Hoos, H.H.: A replica exchange Monte Carlo algorithm for protein folding in the HP model. BMC bioinformatics 8(1), 342 (2007)CrossRefPubMedPubMedCentralGoogle Scholar
  16. 16.
    Vendruscolo, M., Kussell, E., Domany, E.: Recovery of protein structure from contact maps. Folding and Design 2(5), 295–306 (1997)CrossRefPubMedGoogle Scholar
  17. 17.
    Zhang, Y., Skolnick, J.: Scoring function for automated assessment of protein structure template quality. PROTEINS-NEW YORK- 68(4), 1020 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Stefano Teso
    • 1
  • Cristina Di Risio
    • 1
  • Andrea Passerini
    • 1
  • Roberto Battiti
    • 1
  1. 1.Dipartimento di Ingegneria e Scienza dell’InformazioneUniversità degli Studi di TrentoItaly

Personalised recommendations