Computational complexity of a problem in molecular structure prediction.

The computational task of protein structure prediction is believed to require exponential time, but previous arguments as to its intractability have taken into account only the size of a protein's conformational space. Such arguments do not rule out the possible existence of an algorithm, more selective than exhaustive search, that is efficient and exact. (An efficient algorithm is one that is guaranteed, for all possible inputs, to run in time bounded by a function polynomial in the problem size. An intractable problem is one for which no efficient algorithm exists.) Questions regarding the possible intractability of problems are often best answered using the theory of NP-completeness. In this treatment we show the NP-hardness of two typical mathematical statements of empirical potential energy function minimization of macromolecules. Unless all NP-complete problems can be solved efficiently, these results imply that a function minimization algorithm can be efficient for protein structure prediction only if it exploits protein-specific properties that prohibit the simple geometric constructions that we use in our proofs. Analysis of further mathematical statements of molecular structure prediction could constitute a systematic methodology for identifying sources of complexity in protein folding, and for guiding development of predictive algorithms.

[1]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[2]  Andrew Streitwieser,et al.  Introduction to organic chemistry , 1976 .

[3]  C. Papadimitriou,et al.  The Efficiency of Algorithms. , 1978 .

[4]  Ron Unger,et al.  On the computational complexity of protein folding , 1992 .

[5]  Joe Marks,et al.  The Computational Complexity of Cartographic Label Placement , 1991 .

[6]  S. Subbiah,et al.  Prediction of protein side-chain conformation by packing optimization. , 1991, Journal of molecular biology.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Jiří Novotný,et al.  Structure of antibody hypervariable loops reproduced by a conformational search algorithm , 1988, Nature.

[9]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[10]  Jr. George N. Reeke.  Protein folding: computational approaches to an exponential-time problem , 1988 .

[11]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  N. Go,et al.  Ring Closure and Local Conformational Deformations of Chain Molecules , 1970 .

[13]  C. Kittel.  Introduction to solid state physics , 1954 .

[14]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[15]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

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

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  J Skolnick,et al.  Dynamic Monte Carlo simulations of globular protein folding/unfolding pathways. II. Alpha-helical motifs. , 1990, Journal of molecular biology.

[19]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[20]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[21]  K. Dill,et al.  Polymer principles in protein structure and stability. , 1991, Annual review of biophysics and biophysical chemistry.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .