The String-to-String Correction Problem

Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974

Natural Language ProcessingEngineeringString-searching Algorithm+9

A linear space algorithm for computing maximal common subsequences

D. S. Hirschberg · Communications of the ACM · 1975

Mathematical ProgrammingLongest Common SubsequenceLinear Space+13

Proceedings 35th Annual Symposium on Foundations of Computer Science

1994

Programming Language TheoryComputational Complexity TheoryEngineering+5

An Extension of the String-to-String Correction Problem

Robert A. Wagner, Roy Lowrance · Journal of the ACM · 1975

Bounds on the Complexity of the Longest Common Subsequence Problem

Jeffrey D. Ullman, Alfred V. Aho, D. S. Hirschberg · Journal of the ACM · 1976

Computational Complexity TheoryEngineeringGeneral Lower Bound+21