Sparse dynamic programming for longest common subsequence from fragments

Journal of Algorithms

Volumn 42, Issue 2, 2002, Pages 231-254

  Baker, Brenda S ^a   Giancarlo, Raffaele ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOLOGY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SOFTWARE SELECTION AND EVALUATION; DATABASE SYSTEMS; GRAPHICAL USER INTERFACES; SPEECH RECOGNITION; TREES (MATHEMATICS);

FLAT TREES; FRAGMENTS; LONGEST COMMON SUBSEQUENCE; SPARSE DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

EID: 0036488707     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2002.1214     Document Type: Article

References (17)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "Data Structures and Algorithms," Addison-Wesley, Reading, MA , 1983.
2. A. Apostolico, String editing and longest common subsequence, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. 2, pp. 361-398, Springer Verlag, Berlin, 1997.
3. B. S. Baker, Parameterized pattern matching: Algorithms and applications, J. Comput. Syst. Sci. 52 (1) (1996), 28-42.
4. B. S. Baker, Parameterized duplication in strings: Algorithms and an application to software maintenance, SIAM J. Comput. 26(5) (1997), 1343-1362.
5. D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano, Sparse dynamic programming I: Linear cost functions, J. Assoc. Comput. Mach. 39 (1992), 519-545.
6. D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano, Sparse dynamic programming II: Convex and concave cost functions, J. Assoc. Comput. Mach. 39 (1992), 546-567.
7. M. Farach and M. Thorup, Sparse dynamic programming for evolutionary tree comparison, SIAM J. Comput. 26 (1997), 210-230.
8. D. Gusfield, "Algorithms on Strings, Trees and Sequences - Computer Science and Computational Biology," Cambridge University Press, Cambridge, 1997
9. D. S. Hirschberg, Serial computations of Levenshtein distances, in "Pattern Matching Algorithms" (A. Apostolico and Z. Galil, Eds.), pp. 123-142, Oxford University Press, Oxford, 1997.
10. J. W. Hunt and T. G. Szymanski, A fast algorithm for computing longest common subsequences. Comm. ACM 20 (1977), 350-353.
11. D. B. Johnson, A priority queue in which initialization and queue operations take O(log log D) time, Math. Systems Theory 15 (1982), 295-309
12. J. B. Kruskal and D. Sankoff (Eds.), "Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison," Addison-Wesley, Reading, MA, 1983.
13. W. Miller and E. Myers. Chaining multiple alignment fragments in sub-quadratic time, in "Proc. of 6th ACM-SIAM SODA," 1995, pp. 48-57.
14. E. W. Myers, An O(ND) difference algorithm and its variations, Algorithmica 1 (1986), 251-266.
15. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), 80-82.
16. M. S. Waterman, "Introduction to Computational Biology. Maps, Sequences and Genomes," Chapman Hall, Los Angeles, 1995.
17. W. J. Wilbur and D. J. Lipman, Rapid similarity searches of nucleic acid and protein data banks, in "Proc. Nat. Acad. Sci. USA 80," 1983, pp. 726-730.