Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)

Volumn 24, Issue 4, 1977, Pages 664-675

  Hirschberg, Daniel S ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

algorithm; common subsequence; subsequence

Indexed keywords

EID: 84976825385     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322033.322044     Document Type: Article

References (24)

1. Aho, A V, Hopcroft, J E, And Ullman, J D The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, Mass, 1974.
2. Aho, A.V., Hirschberg, D.S., And Ullman, J.D. Bounds on the complexity of the longest common subsequence problem J ACM 23, 1 (Jan 1976), 1-12.
3. Arlazarov, V L., Dinic, E A, Kronrod, M A, And Faradzev, I A On economic construction of the transitive closure of a directed graph Doki Akad Nauk SSSR 194 (1970), 487-488 (in Russian).
4. English transl in Soviet Math Dokl 11, 5 (1970), 1209-1210.
5. Chvatal, V, Klarner, D A, And Knuth, D E Selected combinatorial research problems STAN-CS-72-292, Stanford U, Stanford, Calif, 1972, p 26.
6. Chvatal, V, And Sankoff, D Longest common subsequences of two random sequences STAN-CS-75-477, Stanford U, Stanford, Calif, Jan 1975.
7. Hirschberg, D S On finding maximal common subsequences TR-156, Comptr Sci Lab, Princeton U, Princeton, N.J, Aug 1974.
8. Hirschberg, D S A linear space algorithm for computing maximal common sub sequences Comm ACM 18, 6 (June 1975), 341-343.
9. Hirschberg, D S The longest common subsequence problem Ph D Th, Princeton U, Princeton, N J, Aug 1975.
10. Hunt, J W, And Szymanski, T G A fast algorithm for computing longest common subsequences Comm ACM 20, 5 (May 1977), 350-353.
11. Knuth, D E The Art of Computer Programming, Vol I. Fundamental Algorithms Addison-Wesley, Reading, Mass., sec. ed, 1973.
12. Knuth, D.E. The Art of Computer Programming, Vol 3. Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
13. Lowrance, R, And Wagner, R A An extension of the string-to-string correction problem J ACM 22, 2(April 1975), 177-183.
14. Needleman, S B, And Wunsch, C D A general method applicable to the search for similarities in the amino acid sequence of two proteins J. Mol Biology 48 (1970), 443-453.
15. Paterson, M.S. Unpublished manuscript U of Warwick, Coventry, England, 1974.
16. Sankoff, D Matching sequences under deletion/insertion constraints Proc Nat Acad Sci USA 69, 1(Jan 1974), 4-6.
17. Sellers, M H An algorithm for the distance between two finite sequences J. Combinatorial Theory, Ser A, 16 (1974), 253-258.
18. Szymanski, T G A special case of the maximal common subsequence problem TR-170, Comptr Sci Lab, Princeton U, Princeton, N J, Jan 1975.
19. Van Emde Boas, P An O(nlog log n)on-line algorithm for the insert-extract mm problem TR 74221, Dept Comptr Sci, Cornell U, Ithaca, N Y, Dec 1974.
20. Van Emde Boas, P. Preserving order in a forest in less than logarithmic time Conf Rec 16th Annual Symp on the Foundations of Comptr Sci, Oct 1975, pp 75-84.
21. Wagner, R A On the complexity of the extended strimg-to-string correction problem Proc Seventh Annual ACM Symp on Theory of Comptng, 1975, pp 218-223.
22. Wagner, R A, And Fischer, M J The string-to-strmg correction problem J. ACM 21, 1 (Jan 1974), 168-173.
23. Wong, C.M., And Chandra, A.K. Bounds for the string editing problem J ACM 23, 1 (Jan 1976), 13-16.
24. Yao, C C, And Yao, F C On computing the rank function for a set of vectors UIUCDCS-R-75-699, Dept Comptr Sci, U of Illinois at Urbana-Champaign, Urbana, III, Feb 1975.