THE PROTEIN-FOLDING PROBLEM - FINDING A FEW MINIMUMS IN A NEAR INFINITE SPACE

被引:6
作者
ARGOS, P
ABAGYAN, R
机构
来源
COMPUTERS & CHEMISTRY | 1994年 / 18卷 / 03期
关键词
D O I
10.1016/0097-8485(94)85017-8
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Folding a protein from only a knowledge of its amino acid sequence is a formidable many-body problem. Since it is computationally impossible to test all possible atomic conformations to determine the global minimum representing the compact state, methods need to be developed to sample only a small part of the configurational space and yet delineate the free energy optimum (or nearly so). This article largely reviews such techniques as applied by the authors and their colleagues.
引用
收藏
页码:225 / 231
页数:7
相关论文
共 35 条