Longest common subsequence from fragments via sparse dynamic programming

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

Volumn 1461 LNCS, Issue , 1998, Pages 79-90

  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

APPLICATION PROGRAMS; COMPUTATIONAL EFFICIENCY; COMPUTER PROGRAMMING; FORESTRY; SPEECH RECOGNITION; TREES (MATHEMATICS);

BALANCED TREES; COMPUTATIONAL BIOLOGY; LONGEST COMMON SUBSEQUENCES; OPTIMIZATION PROBLEMS; SOFTWARE SYSTEMS; SPARSE DYNAMIC PROGRAMMING; SUB-STRINGS;

DYNAMIC PROGRAMMING;

EID: 84896779841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_7     Document Type: Conference Paper

References (15)

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 G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 2, pages 361-398, Berlin, 1997. Springer Verlag.
3. B. S. Baker. A theory of parameterized pattern matching: Algorithms and applications. In Proc. 25th Symposium on Theory of Computing, pages 71-80. ACM, 1993.
4. D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano. Sparse dynamic programming I: Linear cost functions. J. of ACM, 39: 519-545, 1992.
5. D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano. Sparse dynamic programming II: Convex and concave cost functions. J. of ACM, 39: 546-567, 1992.
6. M. Farach and M. Thorup. Optimal evolutionary tree comparison by sparse dynamic programming. In Proc. 35th Symposium on Foundations of Computer Science, pages 770-779. IEEE, 1994.
7. D. Gusfield. Algorithms on Strings, Trees and Sequences-Computer Science and Computational Biology. Cambridge University Press, Cambridge, 1997.
8. D.S. Hirschberg. Serial computations of Levenshtein distances. In A. Apostolico and Z. Galil, editors, Pattern Matching Algorithms, pages 123-142, Oxford, 1997. Oxford University Press.
9. J.W. Hunt and T.G. Szymanski. A fast algorithm for computing longest common subsequences. Comm. of the ACM, 20: 350-353, 1977.
10. D. B. Johnson. A priority queue in which initialization and queue operations take O(log log D) time. Math. Sys. Th., 15: 295-309, 1982.
11. J.B. Kruskal and D. Sankoff, editors. Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.
12. W. Miller and E. Myers. Chaining multiple alignment fragments in sub-quadratic time. In Proc. of 6-th ACM-SIAM SODA, pages 48-57, 1995.
13. E. W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1: 251-266, 1986.
14. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. Info. Proc. Lett., 6: 80-82, 1977.
15. M.S. Waterman. Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman Hall, Los Angeles, 1995.