COMPLEXITY OF PROTEIN-FOLDING

COMPLEXITY OF PROTEIN-FOLDING
复制标题

DOI:
10.1007/bf02460704
复制
发表时间:
1993-11-01
影响因子:
3.5
通讯作者:
FRAENKEL, AS
FRAENKEL, AS
中科院分区:
数学4区
文献类型:
--
作者:
FRAENKEL, AS

文献摘要

被引文献

相似文献

据信,蛋白质的天然折叠三维构象是其最低自由能状态,或其最低自由能状态之一。它示出在这里,一个二维和三维的数学模型描述的折叠过程作为一个自由能最小化问题是NP-难的。这意味着这个问题属于一个很大的计算问题集,假设是非常困难的(“条件棘手”)。这一结果的一些可能的后果进行了推测。
It is believed that the native folded three-dimensional conformation of a protein is its lowest free energy state, or one of its lowest. It is shown here that both a two- and three-dimensional mathematical model describing the folding process as a free energy minimization problem is NP-hard. This means that the problem belongs to a large set of computational problems, assumed to be very hard (''conditionally intractable''). Some of the possible ramifications of this result are speculated upon.