TY - JOUR
T1 - The greedy algorithm for edit distance with moves
AU - Kaplan, Haim
AU - Shafrir, Nira
N1 - Funding Information:
✩ Research was partially supported by ISF (Israel Science Foundation) grant 548/00. * Corresponding author. E-mail addresses: haimk@post.tau.ac.il (H. Kaplan), shafrirn@post.tau.ac.il (N. Shafrir).
PY - 2006/1/16
Y1 - 2006/1/16
N2 - A tighter lower bound on performance of GREEDY, that uses a smaller alphabet size, is described. The k-MCSP problem to find minimum partition into blocks where each letter occurs at most k times in the input strings is also discussed. A simple GREEDY algorithm to the block permutation problem is also presented. An infinite family of sequences for which the value of OPT, which is the optimal solution to the block permutation problem, is 2 is also elaborated.
AB - A tighter lower bound on performance of GREEDY, that uses a smaller alphabet size, is described. The k-MCSP problem to find minimum partition into blocks where each letter occurs at most k times in the input strings is also discussed. A simple GREEDY algorithm to the block permutation problem is also presented. An infinite family of sequences for which the value of OPT, which is the optimal solution to the block permutation problem, is 2 is also elaborated.
KW - Analysis of algorithms
KW - Approximation algorithms
KW - Edit distance with moves
KW - Greedy algorithm
KW - String matching
UR - http://www.scopus.com/inward/record.url?scp=27844530215&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2005.08.010
DO - 10.1016/j.ipl.2005.08.010
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:27844530215
VL - 97
SP - 23
EP - 27
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 1
ER -