Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots

We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieong et al. [19], the MAXIMUM STACKING BASE PAIRS problem proposed by Lyngsø [22], and the 2-INTERVAL PATTERN problem proposed by Vialette [36]. For MAXIMUM BASE PAIR STACKINGS and MAXIMUM STACKING BASE PAIRS, we present improved approximation algorithms that can incorporate covariance information from comparative analysis as explicit input of candidate base pairs. For 2-INTERVAL PATTERN, we present improved approximation algorithms on unitary and nearunitary input, and propose a new variant called LENGTH-WEIGHTED BALANCED 2-INTERVAL PATTERN, which is natural in the nearest-neighbor energy model that emphasizes base pair stacking.

• Type: Conference
• Year: 2007
• Where: AAIM
• Authors: Minghui Jiang
• Keywords: AAIM 2007, Algorithms, Base Pair, Base Pair Stacking, MAXIMUM STACKING BASE