Abstract
The protein folding problem and the notion of NP-completeness and NP-hardness are discussed. A lattice model is suggested to capture the essece of protein folding. For this model we present a proof that finding the lowest free energy conformation belongs to the class of NP-hard problems. The implications of the proof are discussed and we suggest that the natural folding process cannot be considered as a search for the global free energy minimum. However, we suggest an explanation as to why, for many proteins, the native functional conformation may coincide with the lowest free energy conformation.
Original language | English |
---|---|
Pages (from-to) | 1183-1198 |
Number of pages | 16 |
Journal | Bulletin of Mathematical Biology |
Volume | 55 |
Issue number | 6 |
DOIs | |
State | Published - Nov 1993 |
Externally published | Yes |