The longest common subsequence problem for sequences with nested arc annotations

Journal of Computer and System Sciences

Volumn 65, Issue 3, 2002, Pages 465-480

  Lin, Guohui ^a   Chen, Zhi Zhong ^b   Jiang, Tao ^c   Wen, Jianjun ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b TOKYO DENKI UNIVERSITY   (Japan)

^c University of California Riverside   (United States)

Author keywords

Approximation algorithm; Book embedding; Longest common subsequence; NP hardness; Polynomial time approximation scheme; Sequence annotation

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPHIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; TREES (MATHEMATICS);

LONGEST ARC-PRESERVING COMMON SUBSEQUENCE (LAPCS); MULTIGENE FAMILIES; POLYNOMIAL-TIME APPROXIMATION; SUBPROBLEMS;

PROBLEM SOLVING;

EID: 0347615178     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00004-1     Document Type: Article

References (25)

1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability: a survey, BIT 25 (1985) 2-23.
2. V. Bafna, S. Muthukrishnan, R. Ravi, Computing similarity between RNA strings, in: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM'95), Helsinki, Finland, Lecture Note in Computer Science, Vol. 937, 1995, pp. 1-16.
3. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
4. T.C. Biedl, P. Bose, E.D. Demaine, A. Lubiw, Efficient algorithms for Peterson's matching theorem, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, MD, 1999, pp. 130-139.
5. T.C. Biedl, G. Kant, M. Kaufmann, On triangulating planar graphs under the four-connectivity constraint, Algorithmica 19 (1997) 427-446.
6. T.C. Biedl, G.-H. Lin, Planar cubic graphs are subhamiltonian, Manuscript, Department of Computer Science, University of Waterloo, March 2000.
7. H.L. Bodlaender, Planar graphs with bounded treewidth, Technical Report RUU-CS-88-14, Department of Computer Science, Utrecht University, The Netherlands, March 1988.
8. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
9. 5-free graphs, J. Algorithms 26 (1998) 166-187.
10. F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a graph layout problem with applications to VLSI design, SIAM J. Algebraic Discrete Methods 8 (1987) 33-58.
11. F. Corpet, B. Michot, RNAling program: alignment of RNA sequences using both primary and secondary structures, Comput. Appl. Bio-sci. 10 (1994) 389-399.
12. P.A. Evans, Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 1999.
13. M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J. Algebraic Discrete Methods 1 (1980) 216-227.
14. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
15. D. Goldman, S. Istrail, C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, in: IEEE Proceedings of the 40th Annual Conference of Foundations of Computer Science (FOCS'99), 1999, pp. 512-521.
16. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, New York, 1997.
17. D.S. Hirschberg, The longest common subsequence problem, Ph.D. Thesis, Princeton University, 1975.
18. T. Jiang, G.-H. Lin, B. Ma, K. Zhang, The longest common subsequence problem for arc-annotated sequences, in: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), Lecture Note in Computer Science, Vol. 1848, 2000, pp. 154-165. Full paper accepted by Journal of Discrete Algorithms.
19. H. Lenhof, K. Reinert, M. Vingron, A polyhedral approach to RNA sequence structure alignment, in: Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB'98), New York, NY, 1998, pp. 153-159.
20. M. Li, B. Ma, 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), Portland, OR, 2000, pp. 425-434.
21. J. Peterson, Die theorie der regulären graphs (the theory of regular graphs), Acta Math. 15 (1891) 193-220.
22. D. Sankoff, Simultaneous solution of the RNA folding, alignment, and protosequence problems, SIAM J. Appl. Math. 45 (1985) 810-825.
23. R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. ACM 21 (1974) 168-173.
24. M. Yannakakis, Embedding planar graphs in four pages, J. Comput. System Sci. 38 (1989) 36-67.
25. K. Zhang, L. Wang, B. Ma, Computing similarity between RNA structures, in: Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), Warwick, UK, Lecture Note in Computer Science, Vol. 1645, 1999, pp. 281-293.