Rotation of Periodic Strings and Short Superstrings release_dgzdejr5a5flphdwiyszq2bl74

by Dany Breslauer, Tao Jiang, Zhigen Jiang

Published in BRICS Report Series by Aarhus University Library.

1996   Issue 21

Abstract

This paper presents two simple approximation algorithms for the shortest superstring problem, with approximation ratios 2.67 and 2.596, improving the best previously published 2.75<br />approximation. The framework of our improved algorithms is similar to that of previous algorithms in the sense that they construct a superstring by computing some optimal cycle covers on the distance graph of the given strings, and<br />then break and merge the cycles to finally obtain a Hamiltonian path, but we make use of new bounds on the overlap between two strings. We prove that for each periodic semi-infinite string alpha = a1 a2 ... of period q, there exists an integer k, such that for any (finite) string s of period p which is inequivalent to alpha, the overlap between s and the rotation alpha[k] = ak ak+1 ... is at most p+ q/2. Moreover, if p<=q, then the overlap between s and alpha[k]<br />is not larger than 2/3 (p+q). In the previous shortest superstring algorithms p+q was used as the standard bound on overlap between two strings with periods p and q.
In application/xml+jats format

Archived Files and Locations

application/pdf  527.5 kB
file_stsrityyozcgje62cumktohada
web.archive.org (webarchive)
tidsskrift.dk (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   1996-01-21
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0909-0878
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 20fbfcb0-1f88-4621-badd-e771f494e4ad
API URL: JSON