TY - JOUR
T1 - Finding the lowest free energy conformation of a protein is an NP-hard problem
T2 - Proof and implications
AU - Unger, Ron
AU - Moult, John
PY - 1993/11
Y1 - 1993/11
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0027690211
U2 - 10.1016/s0092-8240(05)80169-7
DO - 10.1016/s0092-8240(05)80169-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
C2 - 8281131
AN - SCOPUS:0027690211
SN - 0092-8240
VL - 55
SP - 1183
EP - 1198
JO - Bulletin of Mathematical Biology
JF - Bulletin of Mathematical Biology
IS - 6
ER -