Abstract:In the Shortest Superstring problem we are given a set of strings S = {s 1 , . . . , s n } and integer ℓ and the question is to decide whether there is a superstring s of length at most ℓ containing all strings of S as substrings. We obtain several parameterized algorithms and complexity results for this problem.In particular, we give an algorithm which in time 2 O(k) poly(n) finds a superstring of length at most ℓ containing at least k strings of S. We complement this by the lower bound showing that such a pa… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.