A New Pseudoknots Folding Algorithm for RNA Structure Prediction

摘要：

A new dynamic programming algorithm with O(n4) time and O(n3) space is presented to predict the RNa secondary structure including nested pseudoknots and a subclass of crossed pseudoknots. Compared with the Jens algorithm of O(n4) time and O(n2) space, this algorithm can predict more complex pseudoknots. Compared with the Rivas algorithm of O(n6) time and O (n4) space, this algorithm has the same power for the planar pseudoknots prediction.

作者: Hengwu Li Darning Zhu

作者单位: School of Computer Sci and Tech, Shan Dong Univ, Jinan 250100, P.R. China Department of Computer, Sh School of Computer Sci and Tech, Shan Dong Univ, Jinan 250100, P.R. China

会议类型: 国际会议

会议名称: The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)

会议地点: 昆明

会议语种:英文

页码: 94-103

在线出版日期: 2005-08-01（万方平台首次上网日期，不代表论文的发表时间）