The greedy algorithm for shortest superstrings

Haim Kaplan*, Nira Shafrir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


The GREEDY algorithm for shortest superstrings is discussed. The GREEDY algorithm maintains a set of strings, initialized to be equal to S. At each iteration GREEDY picks two strings with maximum overlap from its set, combines them into one string, which it then puts back into the set. It is found that the string produced by GREEDY is of length at most 2 times the length of the shortest superstring.

Original languageEnglish
Pages (from-to)13-17
Number of pages5
JournalInformation Processing Letters
Issue number1
StatePublished - 16 Jan 2005


  • Algorithms
  • Analysis of algorithms
  • Approximation algorithms
  • Shortest superstring


Dive into the research topics of 'The greedy algorithm for shortest superstrings'. Together they form a unique fingerprint.

Cite this