There are efficient dynamic programming solutions to the computation of the Edit Distance from S ∈in [1..σ]n to T ∈in [1..σ]m, for many natural subsets of edit operations, typically in time within O(nm) in the worst-case ...