Evaluating Protein Structure Prediction Models with Evolutionary Algorithms

EAs are competent at solving complex, multimodal optimization problems in applications with large and badly understood search spaces. EAs are therefore among the most promising algorithms for solving the protein structure prediction problem. In this chapter, we use this insight to evaluate, and show the limitations of, simplified models for protein structure prediction. These simplified models, e.g., lattice-based models, have been proposed for their computational efficiency, and it has been proposed that simplified models will work if only a sufficiently competent optimization algorithm is developed. However, in this chapter we show that simplified models do not contain the biological information necessary to solve the protein structure prediction problem. This is demonstrated in two steps: first, we show that the EA finds the correct structure given a fitness function based on information of the known structure. This shows that the EA is sufficiently competent for accurate protein structure prediction. Second, we show that the same algorithm fails to find correct structures when any of the simplified models is used. Our main contribution is to have strengthened the hypothesis that solving the problem of protein structure prediction will require detailed models encoding information at the atomic level. We have also demonstrated that EAs indeed are promising algorithms for eventually solving the protein structure prediction problem.

[1]  Steffen Schulze-Kremer,et al.  Molecular Bioinformatics: Algorithms and Applications , 1995 .

[2]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

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

[4]  R. Unger,et al.  Finding the lowest free energy conformation of a protein is an NP-hard problem: proof and implications. , 1993, Bulletin of mathematical biology.

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

[6]  P Argos,et al.  Folding the main chain of small proteins with the genetic algorithm. , 1994, Journal of molecular biology.

[7]  Ron Unger,et al.  Genetic Algorithm for 3D Protein Folding Simulations , 1993, ICGA.

[8]  J A McCammon,et al.  Computer-aided molecular design. , 1987, Science.

[9]  Erik D. Goodman,et al.  A Standard GA Approach to Native Protein Conformation Prediction , 1995 .

[10]  R. Jernigan,et al.  Residue-residue potentials with a favorable contact pair term and an unfavorable high packing density term, for simulation and threading. , 1996, Journal of molecular biology.

[11]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[12]  Giancarlo Mauri,et al.  Application of Evolutionary Algorithms to Protein Folding Prediction , 1997, Artificial Evolution.

[13]  K. Dill,et al.  Theory for protein mutability and biogenesis. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[14]  A M Lesk,et al.  Interior and surface of monomeric proteins. , 1987, Journal of molecular biology.

[15]  E Bornberg-Bauer,et al.  Exploring the fitness landscapes of lattice proteins. , 1997, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[16]  C. Woese,et al.  On the fundamental nature and evolution of the genetic code. , 1966, Cold Spring Harbor symposia on quantitative biology.