The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Restricted Common Superstring and Restricted Common Supersequence
[article]

2010
*
arXiv
*
pre-print

The shortest common superstring and the shortest common supersequence are two well studied problems having a wide range of applications. In this paper we consider both problems with resource constraints, denoted as the Restricted Common Superstring (shortly RCSstr) problem and the Restricted Common Supersequence (shortly RCSseq). In the RCSstr (RCSseq) problem we are given a set S of n strings, s_1, s_2, ..., s_n, and a multiset t = {t_1, t_2, ..., t_m}, and the goal is to find a permutation π

arXiv:1004.0424v2
fatcat:uwvvac2ewvho7adgwfcpi66x2i