Protein design is NP-hard.
Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple illustrative proof and to discuss the implications for future progress on algorithms for computational protein design.
Pierce
Niles A
NA
Applied and Computational Mathematics, California Institute of Technology, Pasadena, CA 91125, USA. niles@caltech.edu
Winfree
Erik
E
D000465:Algorithms; D000595:Amino Acid Sequence; D017076:Computer-Aided Design; D015233:Models, Statistical; D011487:Protein Conformation; D015202:Protein Engineering / Q000379:methods*; D011506:Proteins / Q000737:chemistry; D013816:Thermodynamics
D011506:Proteins