On finding minimal length superstrings

https://doi.org/10.1016/0022-0000(80)90004-5Get rights and content
Under an Elsevier user license
open archive

Abstract

A superstring of a set of strings {s1,…, sn} is a string s containing each si, 1 ⩽ in, as a substring. The superstring problem is: Given a set S of strings and a positive integer K, does S have a superstring of length K? The superstring problem has applications to data storage; specifically, data compression. We consider the complexity of the superstring problem. NP-completeness results dealing with sets of strings over both finite and infinite alphabets are presented. Also, for a restricted version of the superstring problem, a linear time algorithm is given.

Cited by (0)

Research supported in part by NSF Grant DCR 74-21939 and in part by an IBM research fellowship.

Research supported in part by NSF Grant DCR 74-21939 and in part by Bell Laboratories.