The Binary String-to-String Correction Problem

The Binary String-to-String Correction Problem

String-to-String Correction is the process of transforming some mutable string M into an exact copy of some other string (the target string T), using a shortest sequence of well-defined edit operations. The formal STRING-TO-STRING CORRECTION problem asks for the optimal solution using just two opera...

Full description

Bibliographic Details
Main Author: Spreen, Thomas D.
Other Authors: Ruskey, Frank
Language:English
en
Published: 2013
Subjects:
transportation problem
np-hard
swap
deletion
binary string
Iversonian
target string
mutable string
longest common subsequence
lcs
binary string-to-string correction
Online Access:http://hdl.handle.net/1828/4884

Internet

http://hdl.handle.net/1828/4884

Similar Items