Showing papers on "Edit distance published in 1986"

TL;DR: A longest-common-subsequence algorithm is described which operates in terms of bit or bit-string operations and offers a speedup of the order of the word-length on a conventional computer.

TL;DR: An algorithm is presented to compute the minimum distance associated with editing X to Y subject to the specified constraint and the technique to computed the optimal transformation is presented.