The String-to-String Correction Problem

  title={The String-to-String Correction Problem},
  author={R. Wagner and M. Fischer},
  journal={J. ACM},
The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string. An algorithm is presented which solves this problem in time proportional to the product of the lengths of the two strings… Expand
3,107 Citations
An Extension of the String-to-String Correction Problem
  • 327
  • PDF
The string-to-string correction problem with block moves
  • 214
The Binary String-to-String Correction Problem
  • 4
  • Highly Influenced
Bounds for the String Editing Problem
  • 130
Practical Linear Space Algorithms for Computing String-Edit Distances
  • 2
A Faster Algorithm Computing String Edit Distances
  • 667
  • Highly Influenced
The string merging problem
  • 32
  • Highly Influenced
Learning String-Edit Distance
  • 815
  • PDF
String Editing and Longest Common Subsequences
  • 89