A Novel Method Using Abstract Convex Underestimation in Ab-Initio Protein Structure Prediction for Guiding Search in Conformational Feature Space

To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more efficiently obtain the near-native protein structure.

[1]  Lynn Margaret Batten,et al.  Fast Algorithm for the Cutting Angle Method of Global Optimization , 2002, J. Glob. Optim..

[2]  Madhu Chetty,et al.  Clustered Memetic Algorithm With Local Heuristics for Ab Initio Protein Structure Prediction , 2013, IEEE Transactions on Evolutionary Computation.

[3]  Amarda Shehu,et al.  Probabilistic Search and Energy Guidance for Biased Decoy Sampling in Ab Initio Protein Structure Prediction , 2013, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[4]  Harold A. Scheraga,et al.  Some approaches to the multiple‐minima problem in the calculation of polypeptide and protein structures , 1992 .

[5]  Krzysztof Fidelis,et al.  CASP9 results compared to those of previous casp experiments , 2011, Proteins.

[6]  Amarda Shehu,et al.  Evolutionary-inspired probabilistic search for enhancing sampling of local minima in the protein energy surface , 2012, Proteome Science.

[7]  J. Skolnick,et al.  Local energy landscape flattening: Parallel hyperbolic Monte Carlo sampling of protein folding , 2002, Proteins.

[8]  Amarda Shehu,et al.  In Search of the protein Native State with a Probabilistic Sampling Approach , 2011, J. Bioinform. Comput. Biol..

[9]  Kenneth A. De Jong,et al.  Off-lattice protein structure prediction with homologous crossover , 2013, GECCO '13.

[10]  B. M. Glover,et al.  Cutting angle methods in global optimization , 1999 .

[11]  John L. Klepeis,et al.  Ab initio Tertiary Structure Prediction of Proteins , 2003, J. Glob. Optim..

[12]  Jens Meiler,et al.  ROSETTA3: an object-oriented software suite for the simulation and design of macromolecules. , 2011, Methods in enzymology.

[13]  Frédéric Guyon,et al.  Detecting Protein Candidate Fragments Using a Structural Alphabet Profile Comparison Approach , 2013, PloS one.

[14]  James E. Fitzgerald,et al.  Mimicking the folding pathway to improve homology-free protein structure prediction , 2009, Proceedings of the National Academy of Sciences.

[15]  El-Ghazali Talbi,et al.  A parallel hybrid genetic algorithm for protein structure prediction on the computational grid , 2007, Future Gener. Comput. Syst..

[16]  K. Lindorff-Larsen,et al.  Structure and dynamics of an unfolded protein examined by molecular dynamics simulation. , 2012, Journal of the American Chemical Society.

[17]  K Wüthrich,et al.  Conformational analysis of protein and nucleic acid fragments with the new grid search algorithm FOUND , 1998, Journal of biomolecular NMR.

[18]  Amarda Shehu,et al.  An Ab-initio tree-based exploration to enhance sampling of low-energy protein conformations , 2009, Robotics: Science and Systems.

[19]  Andrew Lewis,et al.  Twin Removal in Genetic Algorithms for Protein Structure Prediction Using Low-Resolution Model , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[20]  David E. Kim,et al.  Sampling bottlenecks in de novo protein structure prediction. , 2009, Journal of molecular biology.

[21]  Gleb Beliakov,et al.  Geometry and combinatorics of the cutting angle method , 2003 .

[22]  G. Rose,et al.  Building native protein conformation from highly approximate backbone torsion angles. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[23]  D. Baker,et al.  Native protein sequences are close to optimal for their structures. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Amarda Shehu,et al.  Guiding the Search for Native-like Protein Conformations with an Ab-initio Tree-based Exploration , 2010, Int. J. Robotics Res..

[25]  L. Kavraki,et al.  Modeling protein conformational ensembles: From missing loops to equilibrium fluctuations , 2006, Proteins.

[26]  Gleb Beliakov,et al.  Challenges of continuous global optimization in molecular structure prediction , 2007, Eur. J. Oper. Res..

[27]  Amarda Shehu,et al.  A multiscale hybrid evolutionary algorithm to obtain sample-based representations of multi-basin protein energy landscapes , 2014, BCB.

[28]  Keehyoung Joo,et al.  Protein structure modeling for CASP10 by multiple layers of global optimization , 2014, Proteins.

[29]  F. Ding,et al.  Ab initio folding of proteins with all-atom discrete molecular dynamics. , 2008, Structure.

[30]  Adam Liwo,et al.  Protein-folding dynamics: overview of molecular simulation techniques. , 2007, Annual review of physical chemistry.

[31]  Christodoulos A. Floudas,et al.  Advances in protein structure prediction and de novo protein design : A review , 2006 .

[32]  David A. Lee,et al.  Predicting protein function from sequence and structure , 2007, Nature Reviews Molecular Cell Biology.

[33]  Clark R. Landis,et al.  SHAPES empirical force field: new treatment of angular potentials and its application to square-planar transition-metal complexes , 1991 .

[34]  Junfeng Huang,et al.  Template-Based Protein Structure Prediction: Template-Based Protein Structure Prediction , 2011 .

[35]  Gleb Beliakov.  Cutting angle method – a tool for constrained global optimization , 2004, Optim. Methods Softw..

[36]  P. Kollman,et al.  Pathways to a protein folding intermediate observed in a 1-microsecond simulation in aqueous solution. , 1998, Science.

[37]  Helio J. C. Barbosa,et al.  A multiple minima genetic algorithm for protein structure prediction , 2014, Appl. Soft Comput..

[38]  Dong Xu,et al.  Toward optimal fragment generations for ab initio protein structure assembly , 2013, Proteins.

[39]  David Baker,et al.  Efficient sampling of protein conformational space using fast loop building and batch minimization on highly parallel computers , 2012, J. Comput. Chem..

[40]  Yang Zhang,et al.  Ab initio protein structure assembly using continuous structure fragments and optimized knowledge‐based force field , 2012, Proteins.

[41]  Krzysztof Fidelis,et al.  CASP10 results compared to those of previous CASP experiments , 2014, Proteins.

[42]  GusfieldDan.  Introduction to the IEEE/ACM Transactions on Computational Biology and Bioinformatics , 2004 .

[43]  L. Kavraki,et al.  Multiscale characterization of protein conformational ensembles , 2009, Proteins.

[44]  C. Anfinsen.  Principles that govern the folding of protein chains. , 1973, Science.

[45]  D. Baker,et al.  An orientation-dependent hydrogen bonding potential improves prediction of specificity and structure for proteins and protein-protein complexes. , 2003, Journal of molecular biology.

[46]  K. Dill,et al.  The Protein-Folding Problem, 50 Years On , 2012, Science.

[47]  P. Bradley,et al.  Toward High-Resolution de Novo Structure Prediction for Small Proteins , 2005, Science.

[48]  P. Wolynes,et al.  Water in protein structure prediction. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[49]  Pascal Van Hentenryck,et al.  On Lattice Protein Structure Prediction Revisited , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[50]  Daniel W. Kulp,et al.  Generalized Fragment Picking in Rosetta: Design, Protocols and Applications , 2011, PloS one.

[51]  Jianhua Wu,et al.  A modified differential evolution algorithm for unconstrained optimization problems , 2013, Neurocomputing.

[52]  Robert J. Petrella,et al.  A versatile method for systematic conformational searches: Application to CheY , 2011, J. Comput. Chem..

[53]  Cecilia Clementi,et al.  Coarse-grained models of protein folding: toy models or predictive tools? , 2008, Current opinion in structural biology.

[54]  J L Klepeis,et al.  Hybrid global optimization algorithms for protein structure prediction: alternating hybrids. , 2003, Biophysical journal.

[55]  M. DePristo,et al.  Simultaneous determination of protein structure and dynamics , 2005, Nature.

[56]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

[57]  Meie Shen,et al.  Differential Evolution With Two-Level Parameter Adaptation , 2014, IEEE Transactions on Cybernetics.

[58]  Adil M. Bagirov,et al.  Global Minimization of Increasing Positively Homogeneous Functions over the Unit Simplex , 2000, Ann. Oper. Res..