The longest common subsequence problem for small alphabet size between many strings

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

Volumn 650 LNCS, Issue , 1992, Pages 469-478

  Hakata, Koji ^a   Imai, Hiroshi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALPHABET SIZE; AMINO ACID SEQUENCE; COMPUTATIONAL EXPERIMENT; LONGEST COMMON SUBSEQUENCE PROBLEM; LONGEST COMMON SUBSEQUENCES;

DNA SEQUENCES;

EID: 77955429897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56279-6_99     Document Type: Conference Paper

References (9)

1. Apostolico, A. and C. Guerra, The longest common subsequence problem revisited, Algorithmica, Vol.2, 1987, pp.315-336.
2. Chin, F. Y. L. and C. K. Poon, A fast algorithm for computing longest common subsequences of small alphabet size, J. of Info. Proc., Vol. 13, No.4, 1990, pp. 463-469.
3. Hirschberg, D. S., A linear space algorithm for computing maximal common subsequences, Comm, ACM, Vol. 18, 1975, pp. 341-343.
4. Hirschberg, D. S., Algorithms for the longest common subsequence problem, J. ACM, Vol. 24, 1977, pp. 664-675.
5. Hunt, J. W. and T. G. A. Szymanski, A fast algorithm for computing longest common subsequences, Comm. ACM, Vol. 20, 1977, pp. 350-353.
6. Kung, H. T., F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM, Vol. 22, No.4, 1975, pp. 469-476.
7. Masek, W. J., and M. S. Paterson, A faster algorithm computing string edit distances, JCSS, 1980, pp.18-31.
8. Preparata, F. P., and M. Shamos, Computational Geometry, Springer-Verlag, 1985.
9. Wagner, R. A., and M. J. Fischer, The string-to-string correction problem, J. ACM, Vol.21, No.1, 1974, pp.168-173.