Computer Science – Computational Engineering – Finance – and Science
Scientific paper
2001-11-20
Computer Science
Computational Engineering, Finance, and Science
A preliminary version of this work appeared in Proceedings of the IEEE International Symposium on Bio-Informatics & Biomedical
Scientific paper
The paper investigates the computational problem of predicting RNA secondary structures. The general belief is that allowing pseudoknots makes the problem hard. Existing polynomial-time algorithms are heuristic algorithms with no performance guarantee and can only handle limited types of pseudoknots. In this paper we initiate the study of predicting RNA secondary structures with a maximum number of stacking pairs while allowing arbitrary pseudoknots. We obtain two approximation algorithms with worst-case approximation ratios of 1/2 and 1/3 for planar and general secondary structures,respectively. For an RNA sequence of $n$ bases, the approximation algorithm for planar secondary structures runs in $O(n^3)$ time while that for the general case runs in linear time. Furthermore, we prove that allowing pseudoknots makes it NP-hard to maximize the number of stacking pairs in a planar secondary structure. This result is in contrast with the recent NP-hard results on psuedoknots which are based on optimizing some general and complicated energy functions.
Ieong Samuel
Kao Ming-Yang
Lam Tak-Wah
Sung Wing-Kin
Yiu Siu-Ming
No associations
LandOfFree
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-275055