Abstract
This paper examines the complexity of comparing sequences that have arcs linking symbol pairs. Such arc-annotated sequences can represent molecular sequences with bonds between bases, such as RNA sequences. Crossing arcs that can represent sequence pseudoknots are included. The problem of finding the longest common subsequence, on which pairwise sequence comparison algorithms are frequently based, is modified to require common subsequences to preserve the arcs induced by the selected symbol positions. This problem is then analyzed using classical and parameterized complexity. It is shown to be NP-complete, and alsoW[1]-complete when parameterized by desired length of common subsequence. If it is parameterized instead by arc cutwidth k, however, it becomes fixed-parameter tractable, and usable for sequences with arc structures of limited cutwidth. An algorithm is given that runs in time 2∈ O(9k nm).
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
V. Bafna, S. Muthukrishnan, and R. Ravi. Computing similarity between RNA strings. DIMACS Technical Report 96–130, 1996.
F. Corpet and B. Minchot. RNAlign program: alignment of RNA sequences using both primary and secondary structures. Computer Applications in the Biosciences 10 (1994), 389–399.
R. Downey and M. Fellows. Fixed-parameter intractability. Proceedings of the Seventh Annual Conference on Structure in Complexity Theory (1992), 36–49.
H. Lenhof, K. Reinert, and M. Vingron. A polyhedral approach to RNA sequence structure alignment. Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB 98) (1998), 153–159.
S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino-acid sequence of two proteins. Journal of Molecular Biology 48 (1970), 443–453.
D. Sankoff. Simultaneous solution of the RNA folding, alignment, and protosequence problems. SIAM Journal of Applied Mathematics 45 (1985), 810–825.
T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981), 195–197.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Evans, P.A. (1999). Finding Common Subsequences with Arcs and Pseudoknots. In: Crochemore, M., Paterson, M. (eds) Combinatorial Pattern Matching. CPM 1999. Lecture Notes in Computer Science, vol 1645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48452-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-48452-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66278-5
Online ISBN: 978-3-540-48452-3
eBook Packages: Springer Book Archive