arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0111051cs.CEcs.DSq-bio
收藏

最大化堆积对数预测任意伪结点的RNA二级结构

Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs

Samuel Ieong, Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Siu-Ming Yiu

摘要:

本文研究了预测RNA二级结构的计算问题。一般认为,允许伪结会使问题变得困难。现有的多项式时间算法是启发式算法,没有性能保证,只能处理有限类型的伪节点。在本文中,我们开始研究预测RNA二级结构的最大数量的堆叠对,同时允许任意的伪结。我们得到了两个近似算法的最坏情况下的近似比为1/2和1/3的平面和一般的二级结构,分别。对于$n$碱基的RNA序列,平面二级结构的近似算法在$O(n^3)$时间内运行,而一般情况下在线性时间内运行。此外,我们证明,允许伪结使它NP-难的最大化的堆叠对在一个平面的二级结构的数量。这一结果是在对比与最近的NP-难的结果,这些结果是基于优化一些一般的和复杂的能量函数。

英文摘要:

The paper investigates the computational problem of predicting RNA secondary structures. The general belief is that allowing pseudoknots makes the problem hard. Existing polynomial-time algorithms are heuristic algorithms with no performance guarantee and can only handle limited types of pseudoknots. In this paper we initiate the study of predicting RNA secondary structures with a maximum number of stacking pairs while allowing arbitrary pseudoknots. We obtain two approximation algorithms with worst-case approximation ratios of 1/2 and 1/3 for planar and general secondary structures,respectively. For an RNA sequence of $n$ bases, the approximation algorithm for planar secondary structures runs in $O(n^3)$ time while that for the general case runs in linear time. Furthermore, we prove that allowing pseudoknots makes it NP-hard to maximize the number of stacking pairs in a planar secondary structure. This result is in contrast with the recent NP-hard results on psuedoknots which are based on optimizing some general and complicated energy functions.

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

↑