Year: 2002
Type: article
Abstract: 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.
Authors: Niles A. Pierce, Erik Winfree
Institution: California Institute of Technology
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: bronze
OpenAlex ID: W2106775540
