The purpose of this paper is to design an algorithm to predict RNA secondary structure, compared with other relevant algorithm, its time complexity and space complexity are reduced.
The dynamic programming algorithm need more time and space; it is very difficult to predict the RNA secondary structure which have more 1,000 bases. The nested RNA secondary structure algorithms cannot predict the RNA secondary structure containing pseudoknots, so the fast algorithm is needed to predict the RNA secondary structure containing pseudoknots urgently. Based on the greedy principle, a model is designed to solve the problem.
A greedy algorithm is presented to predict RNA secondary structure.
The problem for predicting RNA secondary structure including pseudoknots is NP‐complete.
The paper presents a valuable and useful method for predicting the RNA secondary structure.
The new algorithm needs O(n3) time and O(n) space; the experimental results indicate that the algorithm has good accuracy and sensitivity.
