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

The Shortest Common Superstring problem (SCS) consists, for a set of strings S = s_1,...,s_n, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been published, the general objective is now to break the conceptual lower bound barrier of 2. This paper is a step ahead in this direction. Here we focus on a particular instance of the SCS problem, meaning the r-SCS problem, which requires all input strings to be of the same length, r. Golonev et al. proved an approximation ratio which is better than the general one for r<= 6. Here we extend their approach and improve their approximation ratio, which is now better than the general one for r<= 7, and less than or equal to 2 up to r = 6.

• 1 publication
• 1 publication
• 3 publications
• 1 publication
research
12/16/2020

### Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring

A superstring of a set of strings correspond to a string which contains ...
research
11/06/2021

### Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios

In the Shortest Superstring problem, we are given a set of strings and w...
research
08/19/2021

### A Conditional Lower Bound for Episode Matching

Given two strings S and P, the Episode Matching problem is to compute th...
research
12/22/2017

### Longest common substring with approximately k mismatches

In the longest common substring problem we are given two strings of leng...
research
09/25/2019

### Weighted Shortest Common Supersequence Problem Revisited

A weighted string, also known as a position weight matrix, is a sequence...
research
09/23/2018

### Collapsing Superstring Conjecture

In the Shortest Common Superstring (SCS) problem, one is given a collect...
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 ...