Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring

12/16/2020
by   Bastien Cazaux, et al.
0

A superstring of a set of strings correspond to a string which contains all the other strings as substrings. The problem of finding the Shortest Linear Superstring is a well-know and well-studied problem in stringology. We present here a variant of this problem, the Shortest Circular Superstring problem where the sought superstring is a circular string. We show a strong link between these two problems and prove that the Shortest Circular Superstring problem is NP-complete. Moreover, we propose a new conjecture on the approximation ratio of the Shortest Circular Superstring problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2018

Collapsing Superstring Conjecture

In the Shortest Common Superstring (SCS) problem, one is given a collect...
research
04/30/2018

On improving the approximation ratio of the r-shortest common superstring problem

The Shortest Common Superstring problem (SCS) consists, for a set of str...
research
02/10/2021

All instantiations of the greedy algorithm for the shortest superstring problem are equivalent

In the Shortest Common Superstring problem (SCS), one needs to find the ...
research
04/09/2018

Hardness of Consensus Problems for Circular Strings and Time Series Averaging

Consensus problems for strings and sequences appear in numerous applicat...
research
12/26/2021

Quantum Algorithm for the Shortest Superstring Problem

In this paper, we consider the “Shortest Superstring Problem”(SSP) or th...
research
08/06/2018

Polyline defined NC trajectories parametrization. A compact analysis and solution focused on 3D Printing

This paper consists of a formal analysis and one solid solution to the k...
research
12/23/2019

The Weak Circular Repetition Threshold Over Large Alphabets

The repetition threshold for words on n letters, denoted (n), is the inf...

Please sign up or login with your details

Forgot password? Click here to reset