Rotation of Periodic Strings and Short Superstrings
DOI:
https://doi.org/10.7146/brics.v3i21.19984Resumé
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.75approximation. 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
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]
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.
Downloads
Publiceret
1996-01-21
Citation/Eksport
Breslauer, D., Jiang, T., & Jiang, Z. (1996). Rotation of Periodic Strings and Short Superstrings. BRICS Report Series, 3(21). https://doi.org/10.7146/brics.v3i21.19984
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).