Fig. 1
From: Linear space string correction algorithm using the Damerau-Levenshtein distance
DL distance recurrence. a substitution. b insertion. c deletion. d translate A[k:i] to B[l:j] where (a k,bj) and (b l,ai) form a transposition opportunity
Fig. 1 | BMC Bioinformatics