Algorithms and complexity for annotated sequence analysis
Algorithms and complexity for annotated sequence analysis
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On Complexity of the Subpattern Problem
SIAM Journal on Discrete Mathematics
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
On two open problems of 2-interval patterns
Theoretical Computer Science
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
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Parameterized complexity of the arc-preserving subsequence problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Parameterized Complexity
| Hi-index | 0.00 |
A linear matching consists of 2n vertices ordered linearly, together with n vertex-disjoint edges. In this article, we study the Linear Matching Inclusion problem, which takes two linear matchings, called the pattern and the target, and asks if there is an order-preserving mapping of the pattern into the target. We consider several parameterizations of this problem, for which we obtain parameterized algorithms and hardness results. In addition, we settle the parameterized complexity of the related Nesting-Free 2-Interval Pattern problem.