Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM (JACM)

Volumn 23, Issue 1, 1976, Pages 1-12

  Ullman, J D ^a   Aho, A V ^b   Hirschberg, D S ^a,c  

^a PRINCETON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

COMPUTER METATHEORY;

EID: 84976791819     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321921.321922     Document Type: Article

References (18)

1. Aho, A V, Hopcroft, J E, and Ullman, J D The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass, 1974.
2. Cartwright, D, and Harary, F On colorings of signed graphs Elemente der Mathematik 23 (1968), 85-89.
3. Chvatal, V, Klarner, D A, and Knuth, D E Selected combinatorial research problems STAN-CS-72-292, Stanford U, Stanford, Calif, 1972, p 26.
4. Chvatal, V, and Sankoff, D Longest common subsequences of two random sequences STAN-CS-75-477, Stanford U, Stanford, Calif, Jan 1975.
5. Fischer, M J, and Paterson, M S String matching and other products MAC Technical Memorandum 41, MIT, Cambridge, Mass, 1974.
6. Fredman, M L On computing the length of longest increasing subsequences Discrete Mathematics 11, 1 (January 1975) 29-36.
7. Hirschberg, D S A linear space algorithm for computing maximal common subsequences Comm ACM 18, 6 (June 1975) 341-343.
8. Hirschberg, D S On finding maximal common subsequences TR-156, Computer Sciences Laboratory, Princeton U, Princeton, N J, 1974.
9. Hunt, J W, and Szymanski, T G A fast algorithm for computing longest common subsequences Unpublished memorandum, Princeton University, September 1975.
10. Kernighan, B W, and Cherry, L L A system for typesetting mathematics Comm ACM 18, 3 (March 1975), 151-157.
11. 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 MoI Biol 48 (1970), 443-453.
12. Paterson, M S Unpublished manuscript University of Warwick, England, 1974.
13. Reingold, E M On the optimality of some set algorithms J ACM 19, 4 (October 1972), 649-659.
14. Sankoff, D Matching sequences under deletion/insertion constraints Proc. Nat. Acad Sci. USA 69, 1 (Jan, 1972), 4-6.
15. Van Emde Boas, P Preserving order a forest in less than logarithmic time Sixteenth Annual IEEE Symposium on Foundations of Computer Science, October 1975.
16. Wagner, R A, and Fischer, M J The string-to-string correction problem. J ACM 21, 1 (Jan, 1974), 168-173.
17. Wong, C K, and Chandra, A K Bounds for the string editing problem IBM Research Center, Yorktown Heights, New York, 1974
18. Yao, A C, and Yao, F F On computing the rank function for a set of vectors UIUCDCS-R-75-699, Dept of Computer Science, U of Illinois, Urbana, I11, Feb, 1975