Complexity of protein folding
- 144 Downloads
It is believed that the native folded three-dimensional conformation of a protein is its lowest free energy state, or one of its lowest. It is shown here that both a two-and three-dimensional mathematical model describing the folding process as a free energy minimization problems is NP-hard. This means that the problem belongs to a large set of computational problems, assumed to be very hard (“conditionally intractable”). Some of the possible ramifications of this results are speculated upon.
Unable to display preview. Download preview PDF.
- Anfinsen, C. B. 1973. Principles that govern the folding of protein chains.Science 181, 223–230.Google Scholar
- Bennett, C. H., G. Brassard C. Crépeau and M.-H. Skubiszewska. 1992b. Practical quantum oblivious transfer.Proc. Crypt. 91, 351–366.Google Scholar
- Brassard, G. and C. Crépeau. 1990. Quantum bit commitment and coin tossing protocols.Proc. Crypt. 90, 49–61.Google Scholar
- Fraenkel, A. S. 1990. Deexponentializing complex computational mathematical problems using physical or biological systems. Technical Report CS90-30. Department of Applied mathematics and Computer Science. Weizman Institute of Science.Google Scholar
- Gierasch, L. M. and J. King (Eds.) 1990.Protein folding: Deciphering the Second Half of the Genetic Code. Washington, D.C.: American Association for the Advacement of Science.Google Scholar
- Privalov, P. L. 1979. Stability of proteins.Adv. Protein Chem. 33, 167–241.Google Scholar
- Robertson, N. and P. D. Seymour. 1988. Graph minors XV, Wagner's conjecture, manuscript.Google Scholar
- Wasserman, S. A. and N. R. Cozzarelli. 1986. Biochemical topology: applications to DNA recombination and replication.Science 232, 951–960.Google Scholar