HOPE: A Homotopy Optimization Method for Protein Structure Prediction

We use a homotopy optimization method, HOPE, to minimize the potential energy associated with a protein model. The method uses the minimum energy conformation of one protein as a template to predict the lowest energy structure of a query sequence. This objective is achieved by following a path of conformations determined by a homotopy between the potential energy functions for the two proteins. Ensembles of solutions are produced by perturbing conformations along the path, increasing the likelihood of predicting correct structures. Successful results are presented for pairs of homologous proteins, where HOPE is compared to a variant of Newton's method and to simulated annealing.

[1]  Andreas Griewank,et al.  Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++ , 1996, TOMS.

[2]  Tamar Schlick,et al.  Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications , 1999, SIAM J. Optim..

[3]  D. Shanno.  Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .

[4]  Stephen R. Wilson,et al.  Conformational Analysis of Flexible Molecules: Location of the Global Minimum Energy Conformation by the Simulated Annealing Method , 1988 .

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

[6]  Iupaciubcommissiononbiochemic.  IUPAC-IUB Commission on Biochemical Nomenclature. Abbreviations and symbols for the description of the conformation of polypeptide chains. , 1971, Journal of molecular biology.

[7]  Thomas F. Coleman,et al.  Parallel continuation-based global optimization for molecular conformation and protein folding , 1994, J. Glob. Optim..

[8]  S. Nash,et al.  Linear and Nonlinear Programming , 1987 .

[9]  H. Scheraga,et al.  Monte Carlo-minimization approach to the multiple-minima problem in protein folding. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[10]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[11]  E. Allgower,et al.  Introduction to Numerical Continuation Methods , 1987 .

[12]  Thomas F. Coleman,et al.  On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds , 1994, Math. Program..

[13]  I. C. O. B. Nomenclature.  IUPAC-IUB Commission on Biochemical Nomenclature. Abbreviations and symbols for the description of the conformation of polypeptide chains. Tentative rules (1969). , 1970, Biochemistry.

[14]  Jae Kwang Shin,et al.  High directional Monte Carlo procedure coupled with the temperature heating and annealing as a method to obtain the global energy minimum structure of polypeptides and proteins , 1991, Biopolymers.

[15]  Organon Scientific.  Commission on Biochemical Nomenclature , 1987 .

[16]  Thomas F. Coleman,et al.  An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds , 1993, SIAM J. Optim..

[17]  Wolfgang Kliesch,et al.  Computation of stationary points via a homotopy method , 1998 .

[18]  Ionel Michael Navon,et al.  Performance of hybrid methods for large‐scale unconstrained optimization as applied to models of proteins , 2003, J. Comput. Chem..

[19]  Kenneth M. Merz,et al.  The application of the genetic algorithm to the minimization of potential energy functions , 1993, J. Glob. Optim..

[20]  Ernö Pretsch,et al.  Application of genetic algorithms in molecular modeling , 1994, J. Comput. Chem..

[21]  T. Coleman,et al.  On the Convergence of Reflective Newton Methods for Large-scale Nonlinear Minimization Subject to Bounds , 1992 .

[22]  S. Wilson,et al.  Applications of simulated annealing to peptides , 1990, Biopolymers.

[23]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[24]  W. G. Hoover.  molecular dynamics , 1986, Catalysis from A to Z.

[25]  Sigurd Schelstraete,et al.  Chapter 5 - Energy minimization by smoothing techniques: a survey , 1999 .

[26]  Peter Salamon,et al.  Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .

[27]  Y. Okamoto,et al.  A prediction of tertiary structures of peptide by the Monte Carlo simulated annealing method. , 1989, Protein engineering.

[28]  L. Watson,et al.  Modern homotopy methods in optimization , 1989 .

[29]  D. Thirumalai,et al.  Protein folding kinetics: timescales, pathways and energy landscapes in terms of sequence-dependent properties. , 1996, Folding & design.

[30]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[31]  J T Ngo,et al.  Computational complexity of a problem in molecular structure prediction. , 1992, Protein engineering.

[32]  H. Scheraga,et al.  Global optimization of clusters, crystals, and biomolecules. , 1999, Science.

[33]  S Sarkar,et al.  Global optimization on an evolving energy landscape. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  P. Kollman,et al.  A Second Generation Force Field for the Simulation of Proteins, Nucleic Acids, and Organic Molecules , 1995 .