Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications

Ron Unger, John Moult

Research output: Contribution to journalArticlepeer-review

137 Scopus citations

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 languageEnglish
Pages (from-to)1183-1198
Number of pages16
JournalBulletin of Mathematical Biology
Volume55
Issue number6
DOIs
StatePublished - Nov 1993
Externally publishedYes

Fingerprint

Dive into the research topics of 'Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications'. Together they form a unique fingerprint.

Cite this