arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.0577cs.DS
收藏

线性空间中的快速弧标注子序列匹配

Fast Arc-Annotated Subsequence Matching in Linear Space

Philip Bille, Inge Li Goertz

摘要:

弧注释字符串是一个字符串,称为基地,增加了一组对,称为弧,每个连接两个基地。给定弧注释字符串$P$和$Q$,弧保留子序列问题是确定是否可以通过从$Q$删除碱基从$Q$获得$P$。每当删除一个基准时,端点位于该基准中的任何圆弧也将被删除。弧注释字符串中的弧是“嵌套”的,是RNA分子的自然模型,它捕获了这些分子的一级和二级结构。嵌套弧标注字符串的弧保持子序列问题是研究RNA分子功能的基本问题。Gramm等人[ACM Trans.Algorithms 2006]给出了使用$O(nm)$时间和空间的该问题的算法,其中$m$和$n$分别是$P$和$Q$的长度。在本文中,我们提出了一种新的算法,使用$O(nm)$时间和$O(n + m)$空间,从而匹配以前的时间范围,同时显着减少空间从二次项线性。这对于处理大RNA分子至关重要,因为空间可能是瓶颈。为了获得我们的结果,我们引入了一些新的想法,这可能是独立的兴趣弧注释字符串的相关问题。

英文摘要:

An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$ can be obtained from $Q$ by deleting bases from $Q$. Whenever a base is deleted any arc with an endpoint in that base is also deleted. Arc-annotated strings where the arcs are ``nested'' are a natural model of RNA molecules that captures both the primary and secondary structure of these. The arc-preserving subsequence problem for nested arc-annotated strings is basic primitive for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using $O(nm)$ time and space, where $m$ and $n$ are the lengths of $P$ and $Q$, respectively. In this paper we present a new algorithm using $O(nm)$ time and $O(n + m)$ space, thereby matching the previous time bound while significantly reducing the space from a quadratic term to linear. This is essential to process large RNA molecules where the space is likely to be a bottleneck. To obtain our result we introduce several novel ideas which may be of independent interest for related problems on arc-annotated strings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑