A complexity measurement for de novo protein folding

Predicting how a protein folds based solely on its amino acid sequence is an ongoing challenge for the fields of Bioinformatics and Computer Science. Previous attempts to solve this problem have relied on algorithms and a specific set of benchmark proteins. However, there is currently no method for determining if the set of benchmark proteins share a similar level of complexity with proteins of similar size. As a result, a larger variety of benchmarks might be needed to evade this problem and a measure of complexity established to determine the validity of all benchmarks. We propose here the Ouroboros Complexity Measurement for the de novo folding of proteins. This measurement is easy to compute (not an NP hard problem) and allows the comparing of protein complexity.

[1]  B Honig,et al.  Conformational flexibility and protein folding: rigid structural fragments connected by flexible joints in subtilisin BPN. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Abdul Sattar,et al.  Protein folding prediction in 3D FCC HP lattice model using genetic algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[3]  Henry Eyring,et al.  Conformation Changes of Proteins , 1954 .

[4]  J. Kendrew,et al.  A Three-Dimensional Model of the Myoglobin Molecule Obtained by X-Ray Analysis , 1958, Nature.

[5]  Cheng-Jian Lin,et al.  An effective hybrid of hill climbing and genetic algorithm for 2D triangular protein structure prediction , 2011, Proteome Science.

[6]  Songde Ma,et al.  Protein folding simulations of the hydrophobic–hydrophilic model by combining tabu search with genetic algorithms , 2003 .

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

[8]  W. Wong,et al.  Evolutionary Monte Carlo for protein folding simulations , 2001 .

[9]  C. Levinthal.  Are there pathways for protein folding , 1968 .

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

[11]  A. Liwo,et al.  A method for optimizing potential-energy functions by a hierarchical design of the potential-energy landscape: Application to the UNRES force field , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Adam Liwo,et al.  A united-residue force field for off-lattice protein-structure simulations. II. Parameterization of short-range interactions and determination of weights of energy terms by Z-score optimization , 1997, J. Comput. Chem..

[13]  M. L. Anson.  Protein Denaturation and the Properties of Protein Groups , 1945 .

[14]  Zhihong He,et al.  Protein folding simulations of 2D HP model by the genetic algorithm based on optimal secondary structures , 2010, Comput. Biol. Chem..

[15]  Dominique Marion,et al.  An Introduction to Biological NMR Spectroscopy* , 2013, Molecular & Cellular Proteomics.

[16]  K. Dill,et al.  From Levinthal to pathways to funnels , 1997, Nature Structural Biology.

[17]  Edmund K. Burke,et al.  Multimeme Algorithms for Protein Structure Prediction , 2002, PPSN.

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

[19]  A. Sali,et al.  Comparative protein structure modeling of genes and genomes. , 2000, Annual review of biophysics and biomolecular structure.

[20]  Marc S. Lavine,et al.  Going from Strength to Strength , 2014 .

[21]  James A. Coker,et al.  Niche Genetic Algorithms are better than traditional Genetic Algorithms for de novo Protein Folding , 2014, F1000Research.

[22]  Jacek Blazewicz,et al.  From HP Lattice Models to Real Proteins: Coordination Number Prediction Using Learning Classifier Systems , 2006, EvoWorkshops.

[23]  M. Perutz,et al.  Structure Of Hæemoglobin: A Three-Dimensional Fourier Synthesis of Reduced Human Haemoglobin at 5.5 Å Resolution , 1963, Nature.

[24]  Mauro Pezzè,et al.  Software testing and analysis - process, principles and techniques , 2007 .

[25]  Cheng-Jian Lin,et al.  Protein 3D HP Model Folding Simulation Using a Hybrid of Genetic Algorithm and Particle Swarm Optimization , 2011 .

[26]  Maurice H. Halstead,et al.  Elements of software science , 1977 .

[27]  M. Karplus,et al.  Protein-folding dynamics , 1976, Nature.

[28]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[29]  Jyh-Jong Tsay,et al.  An effective evolutionary algorithm for protein folding on 3D FCC HP model by lattice rotation and generalized move sets , 2013, Proteome Science.

[30]  C. Floudas,et al.  ASTRO-FOLD: a combinatorial and global optimization framework for Ab initio prediction of three-dimensional structures of proteins from the amino acid sequence. , 2003, Biophysical journal.

[31]  Gnanasekaran Sundarraj,et al.  An efficient genetic algorithm for predicting protein tertiary structures in the 2D HP model , 2005, GECCO '05.

[32]  Adam Liwo,et al.  A united-residue force field for off-lattice protein-structure simulations. I. Functional forms and parameters of long-range side-chain interaction potentials from protein crystal data , 1997, J. Comput. Chem..

[33]  R. Srinivasan,et al.  LINUS: A hierarchic procedure to predict the fold of a protein , 1995, Proteins.

[34]  S. Moore,et al.  The sequence of the amino acid residues in performic acid-oxidized ribonuclease. , 1960, The Journal of biological chemistry.

[35]  V. Pande,et al.  Pathways for protein folding: is a new view needed? , 1998, Current opinion in structural biology.

[36]  Roger S. Pressman,et al.  Software Engineering: A Practitioner's Approach , 1982 .

[37]  B. Honig.  Protein folding: from the levinthal paradox to structure prediction. , 1999, Journal of molecular biology.

[38]  R. Srinivasan,et al.  Ab initio prediction of protein structure using LINUS , 2002, Proteins.

[39]  Holger H. Hoos,et al.  An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem , 2005, BMC Bioinformatics.

[40]  R. Zwanzig,et al.  Levinthal's paradox. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[41]  T. Dandekar,et al.  Improving genetic algorithms for protein folding simulations by systematic crossover. , 1999, Bio Systems.

[42]  Steven R. Rakitin,et al.  Software verification and validation for practitioners and managers , 2001 .

[43]  James Coker,et al.  DSGA and GA from 'Niche Genetic Algorithms are better than traditional Genetic Algorithms for de novo Protein Folding ' , 2014 .

[44]  P. Zielenkiewicz,et al.  Why similar protein sequences encode similar three-dimensional structures? , 2010 .

[45]  R Unger,et al.  Genetic algorithms for protein folding simulations. , 1992, Journal of molecular biology.