A New Efficient Algorithm for Computing the Longest Common Subsequence

Binary codes capable of correcting deletions, insertions and reversals

V.I. Levenshtein · Soviet physics. Doklady · 1965 · 10.4K citations

Computing, Computer Science, Algorithms +10

The String-to-String Correction Problem

Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974 · 3.1K citations · Full text

Computing, Computer Science, Algorithms +9

AnO(ND) difference algorithm and its variations

Eugene W. Myers · Algorithmica · 1986 · 899 citations

Computing, Computer Science, Algorithms +4

Algorithms for the Longest Common Subsequence Problem

Daniel S. Hirschberg · Journal of the ACM · 1977 · 754 citations · Full text

Computing, Computer Science, Electrical Engineering +9

A fast algorithm for computing longest common subsequences

James Hunt, Thomas G. Szymanski · Communications of the ACM · 1977 · 692 citations · Full text

Computing, Bioinformatics, Computer Science +13