Prediction for RNA planar pseudoknots

Based on m-stems and semi-extensible structure, a model is presented to represent RNA planar pseudoknots, and corresponding dynamic programming algorithm is designed and implemented to predict arbitrary planar pseudoknots and simple non-planar pseudoknots with O(n4) time and O(n3) space. The algorithm folds total 245 sequences in the Pseudobase database, and the test results indicate that the algorithm has good accuracy, sensitivity and specificity.