This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
April-June 2010 (vol. 7 no. 2)
pp. 323-332
Minghui Jiang, Utah State University, Logan
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the problem 2-Interval Pattern proposed by Vialette [CHECK END OF SENTENCE], the problem Maximum Base Pair Stackings proposed by Leong et al. [CHECK END OF SENTENCE], and the problem Maximum Stacking Base Pairs proposed by Lyngsø [CHECK END OF SENTENCE]. For the 2-Interval Pattern, we present polynomial-time approximation algorithms for the problem over the preceding-and-crossing model and on input with the unitary restriction. For Maximum Base Pair Stackings and Maximum Stacking Base Pairs, we present polynomial-time approximation algorithms for the two problems on explicit input of candidate base pairs. We also propose a new problem called Length-Weighted Balanced 2-Interval Pattern, which is natural in the context of RNA secondary structure prediction.
Index Terms:
RNA secondary structure prediction, stacking pairs, 2-intervals.
Citation:
Minghui Jiang, "Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 2, pp. 323-332, April-June 2010, doi:10.1109/TCBB.2008.109
Usage of this product signifies your acceptance of the Terms of Use.