A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
We consider the following problem: given a collection of strings s 1 ; .. .;s m , nd the shortest string s such that each s i appears as a substring (a consecutive block) of s. Although this problem is known to be NP-hard, a simple greedy procedure appears to do quite well and is routinely used in DNA sequencing and data compression practice, namely: repeatedly merge the pair of distinct strings with maximum overlap until only one string remains. Let n denote the length of the optimaldoi:10.1145/103418.103455 dblp:conf/stoc/BlumJLTY91 fatcat:rrhuzscoezfe7o6vh42lte2bvy