The longest common subsequence problem for arc-annotated sequences

Journal of Discrete Algorithms

Volumn 2, Issue 2 SPEC. ISS., 2004, Pages 257-270

  Jiang, Tao ^a   Lin, Guohui ^b   Ma, Bin ^c   Zhang, Kaizhong ^c  

^a University of California Riverside   (United States)

^b UNIVERSITY OF ALBERTA   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Approximation algorithm; Dynamic programming; Longest common subsequence; MAX SNP hard; Maximum independent set; RNA structural similarity comparison; Sequence annotation

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; PATTERN MATCHING; RNA; SET THEORY;

APPROXIMATION ALGORITHM; LONGEST COMMON SUBSEQUENCE; MAX SNP-HARD; MAXIMUM INDEPENDENT SET; RNA STRUCTURAL SIMILARITY COMPARISON; SEQUENCE ANNOTATION;

ALGORITHMS;

EID: 10644263690     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00080-7     Document Type: Article

References (17)

1. V. Bafna, S. Muthukrishnan, R. Ravi, Computing similarity between RNA strings, in: Proceedings of 6th Annual Symposium on Combinatorial Pattern Matching (CPM'95), in: Lecture Notes in Comput. Sci., vol. 937, 1995, pp. 1-16.
2. V. Bafna, S. Muthukrishnan, R. Ravi, Computing similarity between RNA strings, Technical Report 96-30, DIMACS, 1996.
3. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCPs and non-approximability - towards tight results, SIAM J. Comput. 27 (1998) 804-915.
4. P. Berman, T. Fujito, On approximation properties of the independent set problem for degree 3 graphs, in: Proceedings of the 4th International Workshop on Algorithms and Data Structures (WADS'95), in: Lecture Notes in Comput. Sci., vol. 955, 1995, pp. 449-460.
5. F. Corpet, B. Michot, RNAling program: alignment of RNA sequences using both primary and secondary structures, Computer Applications in the Biosciences 10 (1994) 389-399.
6. D.Z. Du, B. Gao, W. Wu, A special case for subset interconnection designs, Discrete Appl. Math. 78 (1997) 51-60.
7. P.A. Evans, Algorithms and complexity for annotated sequence analysis, PhD Thesis, University of Victoria, 1999.
8. P.A. Evans, Finding common subsequences with arcs and pseudoknots, in: Proceedings of 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), in: Lecture Notes in Comput. Sci., vol. 1645, 1999, pp. 270-280.
9. 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.
10. D.S. Hirschberg, The longest common subsequence problem, PhD Thesis, Princeton University, 1975.
11. 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), 1998, pp. 153-159.
12. G.-H. Lin, Z.-Z. Chen, T. Jiang, J.-J. Wen, The longest common subsequence problem for sequences with nested arc annotations, J. Comput. System Sci. 65 (2002) 465-480.
13. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
14. D. Sankoff, Simultaneous solution of the RNA folding, alignment, and protosequence problems, SIAM J. Appl. Math. 45 (1985) 810-825.
15. T.F. Smith, M.S. Waterman, Identification of common molecular subsequences, J. Mol. Biol. 147 (1981) 195-197.
16. R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. ACM 21 (1974) 168-173.
17. K. Zhang, L. Wang, B. Ma, Computing similarity between RNA structures, in: Proceedings of 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), in: Lecture Notes in Comput. Sci., vol. 1645, 1999, pp. 281-293.