Parameterized Algorithms for Inclusion of Linear Matchings
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.
KeywordsParameterized Complexity Parameterized Algorithm Hardness Result Nest Depth Nest Relation
Unable to display preview. Download preview PDF.
- 3.Evans, P.: Algorithms and Complexity fo Annotated Sequence Analysis. PhD thesis, University of Victoria, Canada (1999)Google Scholar