一种基于动态加权匹配的包含假结的RNA折叠算法。
An RNA folding algorithm including pseudoknots based on dynamic weighted matching.
作者信息
Liu Haijun, Xu Dong, Shao Jianlin, Wang Yifei
机构信息
Department of Mathematics, Shanghai University, Shanghai 200444,China.
出版信息
Comput Biol Chem. 2006 Feb;30(1):72-6. doi: 10.1016/j.compbiolchem.2005.10.001.
On the basis of maximum weighted matching (MWM) algorithm, we introduced a dynamic weight related with stem length and used a recursive algorithm to predict RNA secondary structures by searching the stem structure with maximum weight summation step-by-step. This algorithm not only avoids the complicated free energy calculation, but also it could attain higher prediction accuracy. Moreover, our algorithm can predict most types of potential pseudoknots in the RNA structure.
基于最大加权匹配（MWM）算法，我们引入了一个与茎长度相关的动态权重，并使用递归算法通过逐步搜索具有最大权重总和的茎结构来预测RNA二级结构。该算法不仅避免了复杂的自由能计算，而且能够获得更高的预测准确率。此外，我们的算法可以预测RNA结构中大多数类型的潜在假结。
Zotero 插件