CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Superstrings with multiplicities
Authors
B. Cazaux
E. Rivals
Publication date
1 January 2018
Publisher
Schloss Dagstuhl Leibniz Center for Informatics
Doi
Cite
Abstract
A superstring of a set of words P = s1, · · · , sp is a string that contains each word of P as substring. Given P, the well known Shortest Linear Superstring problem (SLS), asks for a shortest superstring of P. In a variant of SLS, called Multi-SLS, each word si comes with an integer m(i), its multiplicity, that sets a constraint on its number of occurrences, and the goal is to find a shortest superstring that contains at least m(i) occurrences of si. Multi-SLS generalizes SLS and is obviously as hard to solve, but it has been studied only in special cases (with words of length 2 or with a fixed number of words). The approximability of Multi-SLS in the general case remains open. Here, we study the approximability of Multi-SLS and that of the companion problem Multi-SCCS, which asks for a shortest cyclic cover instead of shortest superstring. First, we investigate the approximation of a greedy algorithm for maximizing the compression offered by a superstring or by a cyclic cover: the approximation ratio is 1/2 for Multi-SLS and 1 for Multi-SCCS. Then, we exhibit a linear time approximation algorithm, Concat-Greedy, and show it achieves a ratio of 4 regarding the superstring length. This demonstrates that for both measures Multi-SLS belongs to the class of APX problems. © 2018 Yoshifumi Sakai; licensed under Creative Commons License CC-BY.Peer reviewe
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
INRIA a CCSD electronic archive server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:lirmm-01843225v1
Last time updated on 12/01/2019
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:8688
Last time updated on 19/06/2018
Archive Ouverte en Sciences de l'Information et de la Communication
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:lirmm-01843225v1
Last time updated on 06/08/2018
Helsingin yliopiston digitaalinen arkisto
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:helda.helsinki.fi:10138/29...
Last time updated on 11/08/2019