用对偶图将RNA划分为无假结区和无假结区
Partitioning RNAs into pseudonotted and pseudoknot-free regions modeled as Dual Graphs
摘要：
对偶图已被应用于RNA二级结构的建模。本文的目的是双重的：我们提出了新的图论性质的对偶图，以验证进一步的分析和分类的RNA使用这些拓扑表示，我们还提出了一个线性时间算法划分对偶图的拓扑组件称为{ \it块}，并确定每个块是否包含一个{ \it伪结}或没有。我们表明，一个块包含一个假结当且仅当该块有一个顶点的程度$3$或更多，这种特性使我们能够有效地分离较小的RNA片段，并将它们分类为pseudoknotted或pseudoknot-free区域，同时保持这些子结构的完整。尽管非拓扑技术检测和分类的伪结已被有效地应用，对偶图的结构特性提供了一个独特的视角，为进一步分析RNA。可以设想RNA设计的应用，因为具有完整假结的模块化构建块可以组合以形成新的构建体。\end{abstract}
英文摘要：
Dual graphs have been applied to model RNA secondary structures. The purpose of the paper is two-fold: we present new graph-theoretic properties of dual graphs to validate the further analysis and classification of RNAs using these topological representations; we also present a linear-time algorithm to partition dual graphs into topological components called {\it blocks} and determine if each block contains a {\it pseudoknot} or not. We show that a block contains a pseudoknot if and only if the block has a vertex of degree $3$ or more; this characterization allows us to efficiently isolate smaller RNA fragments and classify them as pseudoknotted or pseudoknot-free regions, while keeping these sub-structures intact. Even though non-topological techniques to detect and classify pseudoknots have been efficiently applied, structural properties of dual graphs provide a unique perspective for the further analysis of RNAs. Applications to RNA design can be envisioned since modular building blocks with intact pseudoknots can be combined to form new constructs.\end{abstract}
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
