SIAM Journal on Discrete Mathematics
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
Tree adjoining grammars for RNA structure prediction
Theoretical Computer Science - Special issue: Genome informatics
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Simple approximation algorithm for nonoverlapping local alignments
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Prediction of Consensus RNA Secondary Structures Including Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
SIAM Journal on Computing
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Approximating the 2-interval pattern problem
Theoretical Computer Science
Delta: a toolset for the structural analysis of biological sequences on a 3D triangular lattice
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
On the parameterized complexity of some optimization problems related to multiple-interval graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Inapproximability of maximal strip recovery: II
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Recognizing d-interval graphs and d-track interval graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Inapproximability of maximal strip recovery
Theoretical Computer Science
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Parameterized complexity in multiple-interval graphs: domination
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Impact of the energy model on the complexity of RNA folding with pseudoknots
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Theoretical Computer Science
Hi-index | 0.00 |
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.