Huang Fenix W D, Peng Wade W J, Reidys Christian M
Center for Combinatorics, LPMC-TJKLC, Tianjin, PR China.
J Comput Biol. 2009 Nov;16(11):1549-75. doi: 10.1089/cmb.2008.0194.
In this article, we present the novel ab initio folding algorithm cross, which generates minimum free energy (mfe), 3-noncrossing, canonical RNA structures. Here an RNA structure is 3-noncrossing if it does not contain three or more mutually crossing arcs and canonical, if each of its stacks has size greater or equal than two. Our notion of mfe-structure is based on a specific concept of pseudoknots and respective loop-based energy parameters. The algorithm decomposes into three subroutines: first the inductive construction of motifs and their associated shadows, second the generation of the (rooted) skeleta-trees and third the saturation of the skeleta via context dependent dynamic programming routines.
在本文中,我们提出了一种全新的从头折叠算法cross,该算法可生成最小自由能(mfe)、无三个或更多相互交叉弧的、规范的RNA结构。这里,如果一个RNA结构不包含三个或更多相互交叉的弧,则它是无三个交叉的;如果其每个茎区的大小大于或等于两个,则它是规范的。我们的mfe结构概念基于特定的假结概念和相应的基于环的能量参数。该算法分解为三个子例程:首先是基序及其相关影子的归纳构建,其次是(有根的)骨架树的生成,第三是通过上下文相关的动态规划例程对骨架进行饱和处理。