Complexity of protein folding |
| |
Authors: | Aviezri S. Fraenkel |
| |
Affiliation: | (1) Department of Mathematics, University of Pennsylvania, 19104-6395 Philadelphia, CA, U.S.A.;(2) Present address: Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100 Rehovot, Israel |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|