Efficient computation of all longest common subsequences

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

Volumn 1851, Issue , 2000, Pages 407-418

  Rick, Claus ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA TRANSFER; OBJECT RECOGNITION;

EFFICIENT COMPUTATION; GENERAL METHOD; LONGEST COMMON SUBSEQUENCES; RECONSTRUCTION METHOD; TIME BOUND; TIME COMPLEXITY;

ALGORITHMS;

EID: 84956866576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (17)

1. [1] A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315-336, 1987.
2. [2] R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363-376, January 1991.
3. [3] L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms (extended abstract). Technical report, Dept. of Computer Science, University of Turku, Finland, April 2000. manuscript.
4. [4] N. Blum. Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology. Journal of Algorithms, to appear, 2000.
5. [5] E. Breimer, M. Goldberg, and D. Lim. A learning algorithm for the longest common subsequence problem. In Proceedings of the 2nd Algorithm Engineering and Experiments, pages 147-156, San Francisco, CA, 2000.
6. [6] Francis Y. L. Chin and C. K. Poon. A fast algorithm for computing longest common subsequences of small alphabet size. Journal of Information Processing., 13(4):463-469, 1990.
7. [7] David Eppstein, Zvi Galil, Raáele Giancarlo, and Giuseppe F. Italiano. Sparse dynamic programming I: Linear cost functions. Journal of the ACM, 39(3):519-545, July 1992.
8. [8] D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6):341-343, June 1975.
9. [9] D. S. Hirschberg. Algorithms for the longest common subsequence problem. Jrnl. A.C.M., 24(4):664-675, 1977.
10. [10] D. S. Hirschberg. Serial computations of Levenshtein distances. In A. Apostolico and Z. Galil, editors, Pattern matching algorithms, chapter 4, pages 123-141. Oxford University Press, 1997.
11. [11] W. J Hsu and M. W. Du. New algorithms for the LCS problem. Journal of Computer and System Sciences, 29:133-152, 1984.
12. [12] James W. Hunt and Thomas G. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the ACM, 20(5):350-353, May 1977.
13. [13] N. Nakatsu, Y. Kambayashi, and S. Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18:171-179, 1982.
14. [14] Claus Rick. A new flexible algorithm for the longest common subsequence problem. Nordic Journal of Computing, 2(4):444-461, Winter 1995.
15. [15] Claus Rick. A new flexible algorithm for the longest common subsequence problem. In Zvi Galil and Esko Ukkonen, editors, Combinatorial Pattern Matching, 6th Annual Symposium, volume 937 of Lecture Notes in Computer Science, pages 340-351, Espoo, Finland, 5-7 July 1995. Springer.
16. [16] Claus Rick. Simple and fast linear space computation of longest common subsequences. submitted for publication, 2000.
17. [17] Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, January 1974.