arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1503.05670cs.DS
收藏

基于四俄罗斯技术的RNA折叠时空高效算法

Time and Space Efficient Algorithms for RNA Folding with the Four-Russians Technique

Yinglei Song

摘要:

在本文中,我们开发了新的算法的基本RNA折叠问题。给定一个含有$n$核苷酸的RNA序列,该问题的目标是计算一个无假结的二级结构,使序列中的碱基对数量最大化。我们表明,存在一个动态规划算法,可以解决问题的时间$O(\frac{n^{3}}{\log_{2}{n}})$,而只使用$O(\frac{n^{2}}{\log_{2}{n}})$内存空间。此外,我们表明,该算法的时间复杂度可以进一步提高到$O(\frac{n^{3}}{\log_{2}^{2}{n}})$的代价略有增加的空间复杂度。据我们所知,这是第一个算法,可以解决问题的传统动态规划技术的时间$O(\frac{n^{3}}{\log_{2}^{2}{n}})$。此外,我们的研究结果提高了最好的已知的空间复杂度的上限,有效地解决这个问题和上下文无关的语言识别问题。

英文摘要:

In this paper, we develop new algorithms for the basic RNA folding problem. Given an RNA sequence that contains $n$ nucleotides, the goal of the problem is to compute a pseudoknot-free secondary structure that maximizes the number of base pairs in the sequence. We show that there exists a dynamic programming algorithm that can solve the problem in time $O(\frac{n^{3}}{\log_{2}{n}})$ while using only $O(\frac{n^{2}}{\log_{2}{n}})$ memory space. In addition, we show that the time complexity of this algorithm can be further improved to $O(\frac{n^{3}}{\log_{2}^{2}{n}})$ at the expense of a slightly increased space complexity. To the best of our knowledge, this is the first algorithm that can solve the problem with traditional dynamic programming techniques in time $O(\frac{n^{3}}{\log_{2}^{2}{n}})$. In addition, our results improve the best known upper bound of the space complexity for efficiently solving both this problem and the context-free language recognition problem.

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

↑