Trapezoid graphs and their coloring
Discrete Applied Mathematics
Trapezoid graphs and generalizations, geometry and algorithms
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding Common Subsequences with Arcs and Pseudoknots
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
The Longest Common Subsequence Problem for Arc-Annotated Sequences
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms (TALG)
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
A multiple layer model to compare RNA secondary structures
Software—Practice & Experience
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
What makes the arc-preserving subsequence problem hard?
Transactions on Computational Systems Biology II
A multiple graph layers model with application to RNA secondary structures comparison
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
We study the computational complexity of pattern matching problems over 2-interval sets. These problems occur in the context of molecular biology when a structured pattern, i.e., a RNA secondary structure, has to be found in a sequence. We show that the Pattern Matching OVER 2-INTERVAL SET problem is NP-complete for structured patterns where no pair precedes the other, but can be solved in polynomial time for several interesting special cases.