Volume 8 Number 2 (Feb. 2013)
Home > Archive > 2013 > Volume 8 Number 2 (Feb. 2013) >
JCP 2013 Vol.8(2): 279-283 ISSN: 1796-203X
doi: 10.4304/jcp.8.2.279-283

New Heuristic Algorithm of RNA Structure Prediction including Pseudoknots

Zhendong Liu1, 2 and Daming Zhu1
1 School of Computer Science and Technology, Shandong University, Jinan, China
2 School of Computer Science and Technology, Shandong Jianzhu University, Jinan, China


Abstract—Computational models and methods for predicting secondary structure of RNA sequence are in demand. Based on MFE principle and the relative stability of the n-stems in RNA molecules, Minimum Free Energy method is adopted widely to predict RNA secondary structure. An improved heuristic algorithm is presented to predict RNA pseudoknotted structure, and it can compute arbitrary pseudoknots. The algorithm requires O(n3) time and O(n2) space. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the RNA sequence. The preliminary experimental test on the RNA families in PseudoBase shows that the algorithm is more effective than the existing algorithms.

Index Terms—RNA secondary structure, pseudoknots, nstem, heuristic algorithm

[PDF]

Cite: Zhendong Liu and Daming Zhu, " New Heuristic Algorithm of RNA Structure Prediction including Pseudoknots," Journal of Computers vol. 8, no. 2, pp. 279-283, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>