Improved predicting algorithm of RNA pseudoknotted structure
by Zhendong Liu; Daming Zhu; Qionghai Dai
International Journal of Computational Science and Engineering (IJCSE), Vol. 19, No. 1, 2019

Abstract: The prediction of RNA structure with pseudoknots is NP-hard problem. According to minimum free energy models and computational methods, we investigate the RNA pseudoknotted structures and their characteristics. The paper presents an efficient algorithm for predicting RNA structures with pseudoknots, and the algorithm runs in O(n³) time and O(n²) space. The experimental tests in Rfam10.1 and PseudoBase indicate that the algorithm is more effective and precise, and the algorithm can predict arbitrary pseudoknots. And through our research, we can draw that there exists an 1 + ε (ε > 0) polynomial time approximation scheme in searching maximum number of stackings, and we give the proof of the approximation scheme in RNA pseudoknotted structures.

Online publication date: Mon, 20-May-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com