Abstract
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 [12].
Supported by ERC Advanced Grant DMMCA and by the Hungarian National Research Fund OTKA 67651.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci. 312(2-3), 337–358 (2004)
Blin, G., Fertin, G., Rizzi, R., Vialette, S.: What makes the Arc-Preserving Subsequence problem hard? In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3515, pp. 860–868. Springer, Heidelberg (2005)
Damaschke, P.: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. Inf. Process. Lett. 100(2), 64–68 (2006)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
Evans, P.A.: Algorithms and complexity for annotated sequence analysis. PhD thesis, University of Victoria, Canada (1999)
Evans, P.A.: Finding common subsequences with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 270–280. Springer, Heidelberg (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. An EATCS Series, p. 493. Springer, Heidelberg (2006)
Gramm, J., Guo, J., Niedermeier, R.: Pattern matching for arc-annotated sequences. ACM Trans. Algorithms 2(1), 44–65 (2006)
Jiang, T., Lin, G., Ma, B., Zhang, K.: The longest common subsequence problem for arc-annotated sequences. J. Discrete Algorithms 2(2), 257–270 (2004)
Lin, G., Chen, Z.-Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci. 65(3), 465–480 (2002)
Ma, B., Wang, L., Zhang, K.: Computing similarity between RNA structures. Theor. Comput. Sci. 276(1-2), 111–132 (2002)
Marx, D., Schlotter, I.: Cleaning interval graphs. CoRR abs/1003.1260 (2010) arXiv:1003.1260 [cs.DS]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marx, D., Schlotter, I. (2010). Parameterized Complexity of the Arc-Preserving Subsequence Problem. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)