String-to-string correction problem
From Wikipedia, the free encyclopedia
The string-to-string correction problem refers to the minimum number of edit operations necessary to change one string into another. A single edit operation may be changing a single symbol of the string into another, deleting, or inserting a symbol. The length of the edit sequence provides a measure of the distance between the two strings.
Several algorithms exist to provide an efficient way to determine string distance and specify the minimum number of transformation operations required. Such algorithms are particularly useful for delta creation operations where something is stored as a set of differences relative to a base version. This allows several versions of a single object to be stored much more efficiently than storing them separately. This holds true even for single versions of several objects if they do not differ greatly, or anything in between. Notably, such difference algorithms are used in molecular biology to provide some measure of kinship between different kinds of organisms based on the similarities of their macromolecules (such as proteins or DNA).
[edit] See also
[edit] References
- Robert A. Wagner and Michael J. Fischer (1974). "The String-to-String Correction Problem". Journal of the ACM 21 (1): 168–173.
- Walter F. Tichy (1984). "The string-to-string correction problem with block moves". ACM Transactions on Computer Systems 2 (4): 309–321.
