TY - JOUR
T1 - The greedy algorithm for shortest superstrings
AU - Kaplan, Haim
AU - Shafrir, Nira
N1 - Funding Information:
✩ This research was supported in part by the Israel Science Foundation (ISF) (grant no. 548). * Corresponding author. E-mail addresses: [email protected] (H. Kaplan), [email protected] (N. Shafrir).
PY - 2005/1/16
Y1 - 2005/1/16
N2 - 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.
AB - 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.
KW - Algorithms
KW - Analysis of algorithms
KW - Approximation algorithms
KW - Shortest superstring
UR - http://www.scopus.com/inward/record.url?scp=9944232572&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2004.09.012
DO - 10.1016/j.ipl.2004.09.012
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:9944232572
SN - 0020-0190
VL - 93
SP - 13
EP - 17
JO - Information Processing Letters
JF - Information Processing Letters
IS - 1
ER -