TITLE

Contact prediction in protein modeling: Scoring, folding and refinement of coarse-grained models

AUTHOR(S)
Latek, Dorota; Kolinski, Andrzej
PUB. DATE
January 2008
SOURCE
BMC Structural Biology;2008, Vol. 8, Special section p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Background: Several different methods for contact prediction succeeded within the Sixth Critical Assessment of Techniques for Protein Structure Prediction (CASP6). The most relevant were nonlocal contact predictions for targets from the most difficult categories: fold recognition-analogy and new fold. Such contacts could provide valuable structural information in case a template structure cannot be found in the PDB. Results: We described comprehensive tests of the effectiveness of contact data in various aspects of de novo modeling with CABS, an algorithm which was used successfully in CASP6 by the Kolinski-Bujnicki group. We used the predicted contacts in a simple scoring function for the post-simulation ranking of protein models and as a soft bias in the folding simulations and in the fold-refinement procedure. The latter approach turned out to be the most successful. The CABS force field used in the Replica Exchange Monte Carlo simulations cooperated with the true contacts and discriminated the false ones, which resulted in an improvement of the majority of Kolinski- Bujnicki's protein models. In the modeling we tested different sets of predicted contact data submitted to the CASP6 server. According to our results, the best performing were the contacts with the accuracy balanced with the coverage, obtained either from the best two predictors only or by a consensus from as many predictors as possible. Conclusion: Our tests have shown that theoretically predicted contacts can be very beneficial for protein structure prediction. Depending on the protein modeling method, a contact data set applied should be prepared with differently balanced coverage and accuracy of predicted contacts. Namely, high coverage of contact data is important for the model ranking and high accuracy for the folding simulations.
ACCESSION #
35702904

 

Related Articles

  • Estimation of Protein Folding Rate from Monte Carlo Simulations and Entropy Capacity. Galzitskaya, Oxana V. // Current Protein & Peptide Science;Nov2010, Vol. 11 Issue 8, p523 

    No abstract available.

  • Thermodynamics of Gō-type models for protein folding. Prieto, Lidia; de Sancho, David; Rey, Antonio // Journal of Chemical Physics;10/15/2005, Vol. 123 Issue 15, p154903 

    Gō-type potentials, based on the inter-residue contacts present in the native structure of a protein, are frequently used to predict dynamic and structural features of the folding pathways through computer simulations. However, the mathematical form used to define the model interactions...

  • Quantitative Prediction of Critical Amino Acid Positions for Protein Folding. Thireou, Trias; Atlamazoglou, Vassilios; Papandreou, Nikolaos A.; Lonquety, Mathieu; Chomilier, Jacques; Eliopoulos, Elias // Protein & Peptide Letters;Nov2009, Vol. 16 Issue 11, p1342 

    The MIR algorithm provides an ab initio prediction of a protein's core residues. An improved version, the MIR2, is presented and validated on 3203 proteins from PDB. Structures are decomposed in Closed Loops, their limits constituting the observed core residues. They are predicted by MIR2 with...

  • Fast Protein Loop Sampling and Structure Prediction Using Distance-Guided Sequential Chain-Growth Monte Carlo Method. Tang, Ke; Zhang, Jinfeng; Liang, Jie // PLoS Computational Biology;Apr2014, Vol. 10 Issue 4, p1 

    Loops in proteins are flexible regions connecting regular secondary structures. They are often involved in protein functions through interacting with other molecules. The irregularity and flexibility of loops make their structures difficult to determine experimentally and challenging to model...

  • Computer simulation of proteins: thermodynamics and structure prediction. Meinke, J. H.; Mohanty, S.; Nadler, W.; Zimmermann, O.; Hansmann, U. H. E. // European Physical Journal D -- Atoms, Molecules, Clusters & Opti;Jul2009, Vol. 51 Issue 1, p33 

    Over the last decade, computer simulations have become an increasingly important tool to study proteins. They now regularly complement experimental investigations and often are the only instrument to probe processes in the cell. Here, we summarize some of the algorithmic advances and review...

  • Structural and energetic determinants of co-translational folding. Krobath, Heinrich; Shakhnovich, Eugene I.; Faísca, Patrícia F. N. // Journal of Chemical Physics;Jun2013, Vol. 138 Issue 21, p215101 

    We performed extensive lattice Monte Carlo simulations of ribosome-bound stalled nascent chains (RNCs) to explore the relative roles of native topology and non-native interactions in co-translational folding of small proteins. We found that the formation of a substantial part of the native...

  • Chain length scaling of protein folding time: Beta sheet structures. Dimitrievski, K.; Kasemo, B.; Zhdanov, V. P. // Journal of Chemical Physics;7/8/2000, Vol. 113 Issue 2, p883 

    We present comprehensive 3D lattice Monte Carlo simulations of the folding kinetics of two-turn antiparallel β sheets. The model employed takes into account isotropic nonspecific interactions as in previous flexible heteropolymer models and also orientation-dependent monomer-monomer...

  • How does a protein fold? Sali, Andrej; Shakhnovich, Eugene // Nature;5/19/1994, Vol. 369 Issue 6477, p248 

    Explores the process by which a protein fold with the use of the Monte Carlo method. Global minimum; Condition for folding; Start of folding; Elements of folding mechanism; Time history of folding process.

  • Efficient Sampling in Fragment-Based Protein Structure Prediction Using an Estimation of Distribution Algorithm. Simoncini, David; Zhang, Kam Y. J. // PLoS ONE;Jul2013, Vol. 8 Issue 7, p1 

    Fragment assembly is a powerful method of protein structure prediction that builds protein models from a pool of candidate fragments taken from known structures. Stochastic sampling is subsequently used to refine the models. The structures are first represented as coarse-grained models and then...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics