4 search results - page 1 / 1 » Reoptimization of the Shortest Common Superstring Problem |
CPM
2009
Springer
14 years 2 months ago
2009
Springer
CPM
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
STRINGOLOGY
2004
13 years 8 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
SIAMDM
1998
13 years 7 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...