OPTIMAL COMPUTER FOLDING OF LARGE RNA SEQUENCES USING THERMODYNAMICS AND AUXILIARY INFORMATION
OPTIMAL COMPUTER FOLDING OF LARGE RNA SEQUENCES USING THERMODYNAMICS AND AUXILIARY INFORMATION
复制标题
DOI：
10.1093/nar/9.1.133
复制
发表时间：
1981-01-01
影响因子：
14.9
通讯作者：
STIEGLER, P
中科院分区：
文献类型：
--
作者：
ZUKER, M;STIEGLER, P
本文提出了一种用于折叠 RNA 分子的新计算机方法，该方法使用已发表的堆积和不稳定能量值找到最小自由能构象。它基于应用数学的动态规划算法，比迄今为止在生物学文献中出现的程序更高效、更快，并且可以折叠更大的分子。 459 个核苷酸的免疫球蛋白 γ 1 重链信使 RNA 片段的折叠证明了其强大功能。我们超越基本方法来展示如何将附加信息合并到算法中。这包括化学反应性和酶敏感性的数据。我们通过大肠杆菌 16S 核糖体 RNA 的两个大片段的折叠来说明这一点。
This paper presents a new computer method for folding an RNA molecule that finds a conformation of minimum free energy using published values of stacking and destabilizing energies. It is based on a dynamic programming algorithm from applied mathematics, and is much more efficient, faster, and can fold larger molecules than procedures which have appeared up to now in the biological literature. Its power is demonstrated in the folding of a 459 nucleotide immunoglobulin γ 1 heavy chain messenger RNA fragment. We go beyond the basic method to show how to incorporate additional information into the algorithm. This includes data on chemical reactivity and enzyme susceptibility. We illustrate this with the folding of two large fragments from the 16S ribosomal RNA ofEscherichia coli.