Fig. 3
From: Linear space string correction algorithm using the Damerau-Levenshtein distance

Traces with and without center crossings [18]. a No center crossing. b With center crossing
From: Linear space string correction algorithm using the Damerau-Levenshtein distance
Traces with and without center crossings [18]. a No center crossing. b With center crossing