Abstract
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The LONGEST ARC- PRESERVING COMMON SUBSEQUENCE (LAPCS) Problem has been introduced in [11] as a framework for studying the similarity of arc-annotated sequences. Several algorithmic and complexity results on the LAPCS problem have been presented in [11 17]. In this paper, we continue this line of research and present new algorithmic and complexity results on the LAPCS problem restricted to two nested arc-annotated sequences, denoted as LAPCS(NESTED, NESTED). The restricted problem is perhaps the most interesting variant of the LAPCS problem and has important applications in the comparison of RNA secondary and tertiary structures. Particularly, we prove that LAPCS(NESTED, NESTED) is NP-hard, which answers an open question in [11]. We then present a polynomial-time approximation scheme for LAPCS(NESTED, NESTED) with an additional c- diagonal restriction. An interesting special case, upunary LAPCS(NESTED, NESTED), is also investigated.
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
S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability: a survey. BIT, 25:2–23, 1985.
V. Bafna, S. Muthukrishnan, and R. Ravi. Computing similarity between RNA strings. In Proceedings of 6th Annual Symposium on Combinatorial Pattern Matching (CPM’95), LNCS 937, pages 1–16, 1995.
B.S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41:153–180, 1994.
T.C. Biedl, P. Bose, E.D. Demaine, and A. Lubiw. Efficient algorithms for Peterson’s matching theorem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), pages 130–139, 1999.
T.C. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19:427–446, 1997.
H.L. Bodlaender. Planar graphs with bounded treewidth. Technical Report RUU-CS-88-14, Department of Computer Science, Utrecht University, The Netherlands, March 1988.
H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305–1317, 1996.
Z.-Z. Chen. Efficient approximation schemes for maximization problems on K 3,3-free or K 5-free graphs. Journal of Algorithms, 26:166–187, 1998.
F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg. Embedding graphs in books: a graph layout problem with applications to VLSI design. SIAM Journal on Algebraic and Discrete Methods, 8:33–58, 1987.
F. Corpet and B. Michot. RNAling program: alignment of RNA sequences using both primary and secondary structures. Computer Applications in the Biosciences, 10:389–399, 1994.
P.A. Evans. Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria, 1999.
M.R. Garey, D.S. Johnson, G.L. Miller, and C.H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods, 1:216–227, 1980.
M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.
D. Goldman, S. Istrail, and C.H. Papadimitriou. Algorithmic aspects of protein structure similarity. In IEEE Proceedings of the 40th Annual Conference of Foundations of Computer Science (FOCS’99), pages 512–521, 1999.
D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge, 1997.
D.S. Hirschberg. The Longest Common Subsequence Problem. PhD thesis, Princeton University, 1975.
T. Jiang, G.-H. Lin, B. Ma, and K. Zhang. The longest common subsequence problem for arc-annotated sequences. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), LNCS 1848, pages 154–165, 2000. Full paper accepted by Journal of Discrete Algorithms.
H. Lenhof, K. Reinert, and M. Vingron. A polyhedral approach to RNA sequence structure alignment. In Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB’98), pages 153–159, 1998.
M. Li, B. Ma, and L. Wang. Near optimal multiple sequence alignment within a band in polynomial time. In ACM Proceedings of the 32nd Annual Symposium on Theory of Computing (STOC’00), pages 425–434, 2000.
G.-H. Lin, Z.-Z. Chen, T. Jiang, and J.-J. Wen. The longest common subsequence problem for sequences with nested arc annotations, February 2001. Manuscript.
J. Peterson. Die theorie der regulären graphs (the theory of regular graphs). Acta Mathematica, 15:193–220, 1891.
D. Sankoff. Simultaneous solution of the RNA folding, alignment, and protosequence problems. SIAM Journal on Applied Mathematics, 45:810–825, 1985.
T.F. Smith and M.S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195–197, 1981.
R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the ACM, 21:168–173, 1974.
M. Yannakakis. Embedding planar graphs in four pages. Journal of Computer and System Sciences, 38:36–67, 1989.
K. Zhang, L. Wang, and B. Ma. Computing similarity between RNA structures. In Proceedings of 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), LNCS 1645, pages 281–293, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, GH., Chen, ZZ., Jiang, T., Wen, J. (2001). The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_37
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive