Gouy M, Marliere P, Papanicolaou C, Ninio J
Biochimie. 1985 May;67(5):523-31. doi: 10.1016/s0300-9084(85)80272-8.
Prediction of secondary structures in nucleic acids requires both an adequate physical model and powerful calculation algorithms. In our approach, we cut the molecules in sections of which the contributions to the global energy are context-dependent but roughly additive. The structure of minimum energy is obtained by a tree search under constraints of binary incompatibilities. Our algorithm of the "incompatibility islets" is shown to be more powerful than the "bit parallel forward checking" algorithm, well known in Artificial Intelligence. Recurrent algorithms, proposed by other authors are even more rapid, but often miss the correct structures, for they demand a strict additivity of the energetic contributions, physically unjustified. New strategies, required to deal with molecules of more than 200 nucleotides are discussed. Our physical model has been improved by considering the special case of internal loops beginning with a G-A opposition. A bonus of 1.5 kcal. is attributed to such a feature, at each side of an internal loop. To illustrate our programs, we give the computed schemes for the 3' termini of the small subunit ribosomal RNA.
预测核酸的二级结构既需要合适的物理模型,也需要强大的计算算法。在我们的方法中,我们将分子切割成若干片段,这些片段对全局能量的贡献取决于上下文,但大致具有可加性。通过在二元不相容性约束下进行树形搜索来获得最低能量结构。我们的“不相容性孤岛”算法比人工智能领域中著名的“位并行前向检查”算法更强大。其他作者提出的递归算法甚至更快,但往往会错过正确的结构,因为它们要求能量贡献具有严格的可加性,这在物理上是不合理的。讨论了处理超过200个核苷酸的分子所需的新策略。通过考虑以G - A对开始的内部环的特殊情况,我们改进了物理模型。对于内部环的每一侧,这种特征会赋予1.5千卡的额外能量。为了说明我们的程序,我们给出了小亚基核糖体RNA 3'末端的计算方案。