Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin 300071, PR China.
Math Biosci. 2011 Sep;233(1):47-58. doi: 10.1016/j.mbs.2011.04.009. Epub 2011 Jun 12.
Recently several minimum free energy (MFE) folding algorithms for predicting the joint structure of two interacting RNA molecules have been proposed. Their folding targets are interaction structures, that can be represented as diagrams with two backbones drawn horizontally on top of each other such that (1) intramolecular and intermolecular bonds are noncrossing and (2) there is no "zigzag" configuration. This paper studies joint structures with arc-length at least four in which both, interior and exterior stack-lengths are at least two (no isolated arcs). The key idea in this paper is to consider a new type of shape, based on which joint structures can be derived via symbolic enumeration. Our results imply simple asymptotic formulas for the number of joint structures with surprisingly small exponential growth rates. They are of interest in the context of designing prediction algorithms for RNA-RNA interactions.
最近,已经提出了几种用于预测两个相互作用的 RNA 分子的连接结构的最小自由能(MFE)折叠算法。它们的折叠目标是相互作用结构,可以表示为两个骨架相互平行的图,其中(1)分子内和分子间的键是非交叉的,(2)没有“锯齿”配置。本文研究了具有至少四个弧长的连接结构,其中内部和外部堆积长度至少为两个(没有孤立的弧)。本文的关键思想是考虑一种新的形状类型,基于该类型可以通过符号枚举来推导连接结构。我们的结果暗示了具有惊人小指数增长率的连接结构数量的简单渐近公式。它们在设计 RNA-RNA 相互作用的预测算法方面具有重要意义。