The PTAS of Prediction for RNA Pseudoknotted Structure

It is difficult to compute large RNA molecules with pseudoknots in bioinformatics, the prediction of RNA structure with pseudoknots is an NP-hard problem. According to PTAS principle and MFE models, we investigate the RNA pseudoknotted structure. We first presents an efficient algorithm for predicting RNA structure with pseudoknots. The experimental tests in PseudoBases indicate that the algorithm is more effective and precise. And the paper design an approved 1+e (e > 0) polynomial time approximation scheme in searching maximum number of stackings, and we give the proof of the approximation scheme in RNA pseudoknotted structure, it have theoretical value and practical meanings.