Algorithms for Three Versions of the Shortest Common Superstring Problem

DOI10.1007/978-3-642-13509-5_27zbMath1286.68523OpenAlexW1555609656MaRDI QIDQ3575256

Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Marcin Kubica, Tomasz Walen

Publication date: 26 July 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00742040/file/Algorithms_for_Three_Versions_of_the_Shortest_Common_Superstring_Problem.pdf

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

On the greedy algorithm for the shortest common superstring problem with reversals ⋮ On the Shortest Common Superstring of NGS Reads ⋮ Approximating Shortest Superstring Problem Using de Bruijn Graphs ⋮ Practical lower and upper bounds for the Shortest Linear Superstring ⋮ Superstrings with multiplicities

This page was built for publication: Algorithms for Three Versions of the Shortest Common Superstring Problem