Rabow A A, Scheraga H A
Baker Laboratory of Chemistry, Cornell University, Ithaca, NY 14853-1301.
J Mol Biol. 1993 Aug 20;232(4):1157-68. doi: 10.1006/jmbi.1993.1468.
A way of formulating the protein-folding problem in neural network optimization terms is presented in this paper. This is accomplished by representing the conformation of a protein as an array of the amino acid sequence versus position on a three-dimensional face-centered cubic lattice with an energy function defined in terms of the array variables. The method is called lattice neural network minimization (LNNM). Using the neural network minimization method, the energy function is minimized to locate the global minimum energy for the conformation of the protein. The energy function consisted of site exclusion and bond connectivity penalty terms and a pairwise contact energy potential. The contact energy potential used in the procedure is the united-residue potential of Miyazawa, Jernigan and Covell. The LNNM method found the global minimum for a seven-residue peptide in all of the 15 runs carried out. The time for each run was approximately 30 seconds on one processor of an IBM 3090 computer. For a nine-residue peptide, the global minimum was found in 7 out of 15 runs (47%) in approximately 50 seconds per run. For this peptide, LNNM found the global minimum or the second lowest minimum in 10 of the runs. In the same total CPU times (approximately 750 seconds), a Monte Carlo simulated annealing method found the global minimum or the second lowest minimum in only two runs, demonstrating the superiority of LNNM over the standard Monte Carlo simulated annealing method for this nine-residue peptide. Starting from a uniform array for the protein crambin (46 residues) on the lattice, the energy of the crambin array was minimized and a compact low-energy structure was found in approximately 25 minutes of CPU time. Its energy was much lower than that of the native protein, suggesting that there are inadequacies in the Miyazawa-Jernigan-Covell potential. The LNNM method was applied to the prediction of what was previously called nucleation but more properly called chain-folding initiation sites (CFIS) of a protein. LNNM correctly predicted the CFIS for the two proteins examined, RNase S and T4 lysozyme. The LNNM method was also applied to another chain optimization problem, minimization of the root-mean-square distance error (r.m.s.d.) (a measure similar to r.m.s. deviation) in fitting X-ray structures to a lattice, with good results.
本文提出了一种从神经网络优化角度阐述蛋白质折叠问题的方法。这是通过将蛋白质的构象表示为氨基酸序列与三维面心立方晶格上位置的数组,并根据数组变量定义能量函数来实现的。该方法称为晶格神经网络最小化(LNNM)。使用神经网络最小化方法,将能量函数最小化以找到蛋白质构象的全局最小能量。能量函数由位点排斥和键连通性惩罚项以及成对接触能势组成。该过程中使用的接触能势是宫泽、杰尔尼根和科维尔的统一残基势。LNNM方法在进行的所有15次运行中都找到了一个七肽的全局最小值。在IBM 3090计算机的一个处理器上,每次运行的时间约为30秒。对于一个九肽,在15次运行中有7次(47%)找到了全局最小值,每次运行约50秒。对于该肽,LNNM在10次运行中找到了全局最小值或第二低的最小值。在相同的总CPU时间(约750秒)内,蒙特卡罗模拟退火方法仅在两次运行中找到了全局最小值或第二低的最小值,这表明LNNM在处理这个九肽时优于标准的蒙特卡罗模拟退火方法。从晶格上蛋白质胰凝乳蛋白酶原(46个残基)的均匀数组开始,将胰凝乳蛋白酶原数组的能量最小化,并在约25分钟的CPU时间内找到了一个紧凑的低能量结构。其能量远低于天然蛋白质的能量,这表明宫泽 - 杰尔尼根 - 科维尔势存在不足之处。LNNM方法被应用于预测蛋白质中以前称为成核但更恰当地称为链折叠起始位点(CFIS)的位点。LNNM正确预测了所研究的两种蛋白质核糖核酸酶S和T4溶菌酶的CFIS。LNNM方法还被应用于另一个链优化问题,即最小化将X射线结构拟合到晶格时的均方根距离误差(r.m.s.d.)(一种类似于r.m.s.偏差的度量),并取得了良好的结果。