Toma L, Toma S
Dipartimento di Chimica Organica, Università di Pavia, Italy.
Protein Sci. 1996 Jan;5(1):147-53. doi: 10.1002/pro.5560050118.
Computer simulations of simple exact lattice models are an aid in the study of protein folding process; they have sometimes resulted in predictions experimentally proved. The contact interactions (CI) method is here proposed as a new algorithm for the conformational search in the low-energy regions of protein chains modeled as copolymers of hydrophobic and polar monomers configured as self-avoiding walks on square or cubic lattices. It may be regarded as an extension of the standard Monte Carlo method improved by the concept of cooperativity deriving from nonlocal contact interactions. A major difference with respect to other algorithms is that criteria for the acceptance of new conformations generated during the simulations are not based on the energy of the entire molecule, but cooling factors associated with each residue define regions of the model protein with higher or lower mobility. Nine sequences of length ranging from 20 to 64 residues were used on the square lattice and 15 sequences of length ranging from 46 to 136 residues were used on the cubic lattice. The CI algorithm proved very efficient both in two and three dimensions, and allowed us to localize energy minima not localized by other searching algorithms described in the literature. Use of this algorithm is not limited to the conformational search, because it allows the exploration of thermodynamic and kinetic behavior of model protein chains.
简单精确晶格模型的计算机模拟有助于研究蛋白质折叠过程;它们有时会得出经实验证实的预测结果。本文提出接触相互作用(CI)方法,作为一种新算法,用于在以疏水和极性单体共聚物为模型的蛋白质链低能区域进行构象搜索,这些共聚物在方形或立方晶格上构造成自回避行走。它可被视为标准蒙特卡罗方法的扩展,通过源自非局部接触相互作用的协同性概念进行了改进。与其他算法的一个主要区别在于,模拟过程中生成新构象的接受标准并非基于整个分子的能量,而是与每个残基相关的冷却因子定义了模型蛋白质中具有较高或较低流动性的区域。在方形晶格上使用了9个长度从20到64个残基的序列,在立方晶格上使用了15个长度从46到136个残基的序列。CI算法在二维和三维中都证明非常有效,并且使我们能够定位文献中描述其他搜索算法未定位到的能量最小值。该算法的应用不限于构象搜索,因为它允许探索模型蛋白质链的热力学和动力学行为。