Browsing by Subject "Edit distance"

Now showing items 1-2 of 2

    • Adaptive computation of the swap-insert correction distance 
      Barbay, Jeremy; Perez-Lantero, Pablo (Association for Computing Machinery, 2018)
      The Swap-Insert Correction distance from a string S of length n to another string L of length m≥n on the alphabet [1.δ] is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting S into L. ...
    • Indexed dynamic programming to boost edit distance and LCSS computation 
      Barbay, Jérémy; Olivares, Andrés (Springer Verlag, 2018)
      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 ...