Approximating algorithm for RNA structure prediction including pseudoknots.

ICAL(2011)

引用 0|浏览31
暂无评分
摘要
RNA structure and tertiary structure could be represented by a set of nested arcs and a set of crossing arcs. Based on the relative stability of the stems in RNA molecules, an approximating algorithm is presented to predict RNA pseudoknotted structure, the algorithm takes O(n3) time and O(n) space, the algorithm outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence. The preliminary experimental test on the RNA subsequences in PseudoBase confirm that the algorithm has good sensitivity and specificity, and are among the most reasonable in the literature. © 2011 IEEE.
更多
查看译文
关键词
approximating algorithm,np-complete,rna structure,stem,algorithm design,np complete,approximation algorithms,stability,algorithm design and analysis,computational complexity,accuracy,approximation theory,rna,heuristic algorithm,prediction algorithms,macromolecules,time complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要