Parameterized Complexity of the Arc-Preserving Subsequence Problem
We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete characters from T to obtain P. Since even the unary version of APS is NP-hard, we used the framework of parameterized complexity, focusing on a parameterization of this problem where the parameter is the number of deletions we can make. We present a linear-time FPT algorithm for a generalization of APS, applying techniques originally designed to give an FPT algorithm for Induced Subgraph Isomorphism on interval graphs .
Unable to display preview. Download preview PDF.
- 5.Evans, P.A.: Algorithms and complexity for annotated sequence analysis. PhD thesis, University of Victoria, Canada (1999)Google Scholar
- 7.Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. An EATCS Series, p. 493. Springer, Heidelberg (2006)Google Scholar
- 12.Marx, D., Schlotter, I.: Cleaning interval graphs. CoRR abs/1003.1260 (2010) arXiv:1003.1260 [cs.DS]Google Scholar