The Shortest Superstring Problem

DOI10.1007/978-1-4939-0808-0_10zbMath1321.90115OpenAlexW140110130MaRDI QIDQ2949914

Leonidas S. Pitsoulis, Theodoros P. Gevezes

Publication date: 5 October 2015

Published in: Optimization in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0808-0_10

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (6)

All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent ⋮ On the greedy algorithm for the shortest common superstring problem with reversals ⋮ Collapsing Superstring Conjecture ⋮ Relationship between superstring and compression measures: new insights on the greedy conjecture ⋮ Practical lower and upper bounds for the Shortest Linear Superstring ⋮ Superstrings with multiplicities

This page was built for publication: The Shortest Superstring Problem