The greedy algorithm for edit distance with moves

Haim Kaplan*, Nira Shafrir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)23-27
Number of pages5
JournalInformation Processing Letters
Issue number1
StatePublished - 16 Jan 2006


  • Analysis of algorithms
  • Approximation algorithms
  • Edit distance with moves
  • Greedy algorithm
  • String matching


Dive into the research topics of 'The greedy algorithm for edit distance with moves'. Together they form a unique fingerprint.

Cite this