Towards optimally solving the longest common subsequence problem for sequences with nested arc annotations in linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2373, Issue , 2002, Pages 99-114

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; PATTERN MATCHING;

APPROXIMATION RESULTS; ARC STRUCTURES; ARC-PRESERVING SUBSEQUENCES; EXACT ALGORITHMS; FIXED-PARAMETER TRACTABILITY; LONGEST COMMON SUBSEQUENCE PROBLEM; POLYNOMIAL TIME APPROXIMATION SCHEMES; STRUCTURE COMPARISONS;

POLYNOMIAL APPROXIMATION;

EID: 84937413287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_10     Document Type: Conference Paper

References (19)

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229: 3–27, 2001
2. H. L. Bodlaender, R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Ware-ham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11: 49–57, 1995
3. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of sequence alignment and consensus. Theoreti cal Computer Science, 147:31–54, 1995.
4. P. Bonizzoni, G. Della Vedova, and G. Mauri. Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics, 110:13–24, 2001
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999
6. P. A. Evans. Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria, Canada. 1999.
7. P. A. Evans. Finding common subsequences with arcs and pseudoknots. In Proc. of 10th CPM, number 1645 in LNCS, pages 270–280, 1999. Springer
8. P. A. Evans and H. T. Wareham. Exact algorithms for computing pairwise alignments and 3-medians from structure-annotated sequences. In Proc. of Pacific Symposium on Biocomputing, pages 559–570, 2001
9. M. R. Fellows. Parameterized complexity: the main ideas and some research frontiers. In Proc. of 12th ISAAC, number 2223 in LNCS, pages 291–307, 2001. Springer.
10. D. Goldman, S. Istrail, and C. H. Papadimitriou. Algorithmic aspects of protein structure similarity. In Proc. of 40th IEEE FOCS, pages 512–521, 1999
11. J. Guo. Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences. Diploma thesis, Universität Tübingen, Fed. Rep. of Germany. February 2002
12. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press. 1997
13. T. Jiang, G.-H. Lin, B. Ma, and K. Zhang. The longest common subsequence problem for arc-annotated sequences. In Proc. of 11th CPM, number 1848 in LNCS, pages 154–165, 2000. Springer. Full paper accepted by Journal of Discrete Algorithms.
14. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoreti cal Computer Science, 223: 1–72, 1999
15. G. Lancia, R. Carr, B. Walenz, and S. Istrail. 101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In Proc. of 5th ACM RECOMB, pages 193–202, 2001
16. M. Li, B. Ma, and L. Wang. Near optimal multiple alignment within a band in polynomial time. In Proc. of 32nd ACM STOC, pages 425–434, 2000
17. G.-H. Lin, Z.-Z. Chen, T. Jiang, and J. Wen. The longest common subsequence problem for sequences with nested arc annotations. In Proc. of 28th ICALP, number 2076 in LNCS, pages 444–455, 2001. Springer
18. M. Paterson and V. Dancik. Longest common subsequences. In Proc. of 19th MFCS, number 841 in LNCS, pages 127–142, 1994. Springer
19. D. Sankoff and J. Kruskal (eds.). Time Warps, String Edits, and Macromolecules. Addison-Wesley. 1983. Reprinted in 1999 by CSLI Publications