期刊
PROTEIN ENGINEERING
卷 15, 期 10, 页码 779-782出版社
OXFORD UNIV PRESS
DOI: 10.1093/protein/15.10.779
关键词
complexity; design; NP-complete; NP-hard; proteins
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据