Computing the similarity of two sequences with nested arc annotations

Theoretical Computer Science

Volumn 312, Issue 2-3, 2004, Pages 337-358

  Alber, Jochen ^a   Gramm, Jens ^a   Guo, Jiong ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Arc annotated sequences; Fixed parameter tractability; Longest common subsequence; NP completeness; RNA secondary structure; Search tree

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; DATA REDUCTION; POLYNOMIALS; QUADRATIC PROGRAMMING; RNA; TREES (MATHEMATICS);

FIXED PARAMETER TRACTABILITY; LONGEST COMMON SUBSEQUENCE (LCS); NESTED ARC ANNOTATIONS; RNA SECONDARY STRUCTURES; SEARCH TREES;

PROBLEM SOLVING;

EID: 0346339702     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.026     Document Type: Article

References (28)

1. Alber J., Gramm J., Niedermeier R. Faster exact solutions for hard problems. a parameterized point of view Discrete Math. 229:2001;3-27.
2. Blanchette M., Schwikowski B., Tompa M. Algorithms for phylogenetic footprinting. J. Comput. Biol. 9(2):2002;211-224.
3. Bodlaender H.L., Downey R.G., Fellows M.R., Hallett M.T., Wareham H.T. Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11:1995;49-57.
4. Bodlaender H.L., Downey R.G., Fellows M.R., Wareham H.T. The parameterized complexity of sequence alignment and consensus. Theoret. Comput. Sci. 147:1995;31-54.
5. Bonizzoni P., Della Vedova G., Mauri G. Experimenting an approximation algorithm for the LCS. Discrete App. Math. 110:2001;13-24.
6. R.G. Downey, Parameterized complexity for the skeptic (invited paper), in: Proc. 18th IEEE Conf. on Computational Complexity 2003, pp. 147-168.
7. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer, Berlin.
8. P.A. Evans, Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, Canada, 1999.
9. P.A. Evans, Finding common subsequences with arcs and pseudoknots, in: Proc. 10th CPM, Lecture Notes in Computer Science, Vol. 1645, Springer, Berlin, 1999, pp. 270-280.
10. P.A. Evans, H.T. Wareham, Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences, in: Proc. Pacific Symp. on Biocomputing, 2001, pp. 559-570.
11. M.R. Fellows, Parameterized complexity: the main ideas and some research frontiers, in: Proc. 12th ISAAC, Lecture Notes in Computer Science, Vol. 2223, Springer, Berlin, 2001, pp. 291-307.
12. D. Goldman, S. Istrail, C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, in: Proc. 40th IEEE FOCS, 1999, pp. 512-521.
13. Graham R.L., Knuth D.E., Patashnik O. Concrete Mathematics. 1989;Addison-Wesley, Reading, MA.
14. J. Gramm, J. Guo, R. Niedermeier, Pattern matching for arc-annotated sequences, in: Proc. 22nd FSTTCS, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 182-193.
15. J. Guo, Exact algorithms for the longest common subsequence problem for arc-annotated sequences. Diploma Thesis, Universität Tübingen, Federal Republic of Germany, February 2002.
16. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
17. Harrison M.A. Introduction to Formal Language Theory. 1978;Addison-Wesley, Reading, MA.
18. T. Jiang, G.-H. Lin, B. Ma, K. Zhang, The longest common subsequence problem for arc-annotated sequences, in: Proc. 11th CPM, Lecture Notes in Computer Science, Vol. 1848 Springer, Berlin, 2000, pp. 154-165, J. Discrete Algorithms, accepted for publication.
19. Jiang T., Lin G.-H., Ma B., Zhang K. A general edit distance between two RNA structures. J. Comput. Biol. 9(2):2002;371-388.
20. Khot S., Raman V. Parameterized complexity of finding subgraphs with hereditary properties. Theoret. Comput. Sci. 289:2002;997-1008.
21. Kullmann O. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223:1999;1-72.
22. G. Lancia, R. Carr, B. Walenz, S. Istrail, 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem, in: Proc. 5th ACM RECOMB, 2001, pp. 193-202.
23. M. Li, B. Ma, L. Wang, Near optimal multiple alignment within a band in polynomial time, in: Proc. 32nd ACM STOC, 2000, pp. 425-434.
24. Lin G.-H., Chen Z.-Z., Jiang T., Wen J. The longest common subsequence problem for sequences with nested arc annotations. J. Comput. System Sci. 65(3):2002;465-480.
25. Ma B., Wang L., Zhang K. Computing similarity between RNA structures. Theoret. Comput. Sci. 276:2002;111-132.
26. M. Paterson, V. Dancik, Longest common subsequences, in: Proc. 19th MFCS, Lecture Notes in Computer Science, Vol. 841, Springer, Berlin, 1994, pp. 127-142.
27. K. Pietrzak, On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems, Manuscript, ETH Zürich, March 2002, J. Comput. System Sci. 67 (4) 757-771.
28. D. Sankoff, J. Kruskal (Eds.), Time Warps, String Edits, and Macromolecules, Addison-Wesley, Reading, MA, 1983, Reprinted in 1999 by CSLI Publications.