The shortest superstring problem

DOI10.1007/978-1-4939-0808-0_10MaRDI QIDQ2949914zbMATH OpenOpenAlexFDO

Authors Theodoros P. Gevezes, Leonidas Pitsoulis

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)

Recommendations

• Improved length bounds for the shortest superstring problem
• Approximating Shortest Superstrings
• Algorithms for Three Versions of the Shortest Common Superstring Problem
• Approximation algorithms for the shortest common superstring problem
• \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring

Cited in

(7)

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

This page was built for publication: The shortest superstring problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949914)