Sequential and Parallel Approximation of Shortest Superstrings

DOI10.1006/jagm.1996.0823zbMath0866.68047OpenAlexW2061753037MaRDI QIDQ3128987

Marek Piotrów, Leszek Gąsieniec, Wojciech Rytter, Artur Czumaj

Publication date: 6 July 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9ce5c127f3c872f000a00da9e1e80dfc12b9cba3

zbMATH Keywords

data compressionsuperstrings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (4)

The greedy algorithm for shortest superstrings ⋮ Recognition of overlap graphs ⋮ On the Shortest Common Superstring of NGS Reads ⋮ NC algorithms for finding a maximal set of paths with application to compressing strings

This page was built for publication: Sequential and Parallel Approximation of Shortest Superstrings