TITLE

A Probabilistic Fragment-Based Protein Structure Prediction Algorithm

AUTHOR(S)
Simoncini, David; Berenger, Francois; Shrestha, Rojan; Kam Y. J. Zhang
PUB. DATE
July 2012
SOURCE
PLoS ONE;Jul2012, Vol. 7 Issue 7, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Conformational sampling is one of the bottlenecks in fragment-based protein structure prediction approaches. They generally start with a coarse-grained optimization where mainchain atoms and centroids of side chains are considered, followed by a fine-grained optimization with an all-atom representation of proteins. It is during this coarse-grained phase that fragment-based methods sample intensely the conformational space. If the native-like region is sampled more, the accuracy of the final all-atom predictions may be improved accordingly. In this work we present EdaFold, a new method for fragment-based protein structure prediction based on an Estimation of Distribution Algorithm. Fragment-based approaches build protein models by assembling short fragments from known protein structures. Whereas the probability mass functions over the fragment libraries are uniform in the usual case, we propose an algorithm that learns from previously generated decoys and steers the search toward native-like regions. A comparison with Rosetta AbInitio protocol shows that EdaFold is able to generate models with lower energies and to enhance the percentage of near-native coarse-grained decoys on a benchmark of 20 proteins. The best coarse-grained models produced by both methods were refined into allatom models and used in molecular replacement. All atom decoys produced out of EdaFold's decoy set reach high enough accuracy to solve the crystallographic phase problem by molecular replacement for some test proteins. EdaFold showed a higher success rate in molecular replacement when compared to Rosetta. Our study suggests that improving low resolution coarse-grained decoys allows computational methods to avoid subsequent sampling issues during all-atom refinement and to produce better all-atom models. EdaFold can be downloaded from http://www.riken.jp/zhangiru/software/.
ACCESSION #
79784190

 

Related Articles

  • Interplay of Nkx3.2, Sox9 and Pax3 Regulates Chondrogenic Differentiation of Muscle Progenitor Cells. Cairns, Dana M.; Renjing Liu; Sen, Manpreet; Canner, James P.; Schindeler, Aaron; Little, David G.; Li Zeng // PLoS ONE;Jul2012, Vol. 7 Issue 7, p1 

    Muscle satellite cells make up a stem cell population that is capable of differentiating into myocytes and contributing to muscle regeneration upon injury. In this work we investigate the mechanism by which these muscle progenitor cells adopt an alternative cell fate, the cartilage fate. We show...

  • Improved model quality assessment using ProQ2. Ray, Arjun; Lindahl, Erik; Wallner, Björn // BMC Bioinformatics;2012, Vol. 13 Issue 1, p1 

    Background: Employing methods to assess the quality of modeled protein structures is now standard practice in bioinformatics. In a broad sense, the techniques can be divided into methods relying on consensus prediction on the one hand, and single-model methods on the other. Consensus methods...

  • Heterogeneous Ensemble Combination Search Using Genetic Algorithm for Class Imbalanced Data Classification. Haque, Mohammad Nazmul; Noman, Nasimul; Berretta, Regina; Moscato, Pablo // PLoS ONE;1/14/2016, Vol. 11 Issue 1, p1 

    Classification of datasets with imbalanced sample distributions has always been a challenge. In general, a popular approach for enhancing classification performance is the construction of an ensemble of classifiers. However, the performance of an ensemble is dependent on the choice of...

  • RASP: rapid modeling of protein side chain conformations. Miao, Zhichao; Cao, Yang; Jiang, Taijiao // Bioinformatics;Nov2011, Vol. 27 Issue 22, p3117 

    Motivation: Modeling of side chain conformations constitutes an indispensable effort in protein structure modeling, protein–protein docking and protein design. Thanks to an intensive attention to this field, many of the existing programs can achieve reasonably good and comparable...

  • Layers: A molecular surface peeling algorithm and its applications to analyze protein structures. Karampudi, Naga Bhushana Rao; Bahadur, Ranjit Prasad // Scientific Reports;11/13/2015, p16141 

    We present an algorithm 'Layers' to peel the atoms of proteins as layers. Using Layers we show an efficient way to transform protein structures into 2D pattern, named residue transition pattern (RTP), which is independent of molecular orientations. RTP explains the folding patterns of proteins...

  • MULTI-OBJECTIVE APPROACH IN PREDICTING AMINO ACID INTERACTION NETWORK USING ANT COLONY OPTIMIZATION. Hawlader, Md. Shiplu; Tareeq, Saifuddin Md. // International Journal of Artificial Intelligence & Applications;Jan2014, Vol. 5 Issue 1, p113 

    Protein can be represented by amino acid interaction network. This network is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. In this paper we have formalized amino acid interaction network prediction as a multi-objective evolutionary...

  • Improved hybrid optimization algorithm for 3D protein structure prediction. Zhou, Changjun; Hou, Caixia; Wei, Xiaopeng; Zhang, Qiang // Journal of Molecular Modeling;Jul2014, Vol. 20 Issue 7, p1 

    A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search...

  • An effective hybrid of hill climbing and genetic algorithm for 2D triangular protein structure prediction. Shih-Chieh Su; Cheng-Jian Lin; Chuan-Kang Ting // Proteome Science;2011 Supplement 1, Vol. 9 Issue Suppl 1, p1 

    Background: Proteins play fundamental and crucial roles in nearly all biological processes, such as, enzymatic catalysis, signaling transduction, DNA and RNA synthesis, and embryonic development. It has been a long-standing goal in molecular biology to predict the tertiary structure of a protein...

  • Army ants algorithm for rare event sampling of delocalized nonadiabatic transitions by trajectory surface hopping and the estimation of sampling errors by the bootstrap method. Nangia, Shikha; Jasper, Ahren W.; Miller III, Thomas F.; Truhlar, Donald G. // Journal of Chemical Physics;2/22/2004, Vol. 120 Issue 8, p3586 

    The most widely used algorithm for Monte Carlo sampling of electronic transitions in trajectory surface hopping (TSH) calculations is the so-called anteater algorithm, which is inefficient for sampling low-probability nonadiabatic events. We present a new sampling scheme (called the army ants...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics