Faster implementation of a shortest superstring approximation

DOI10.1016/0020-0190(94)00097-2zbMath0942.68781OpenAlexW2042037790MaRDI QIDQ1336759

Dan Gusfield

Publication date: 26 February 1996

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00097-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (3)

A linear time algorithm for shortest cyclic cover of strings ⋮ Improved length bounds for the shortest superstring problem ⋮ Recognition of overlap graphs

Cites Work

• Unnamed Item
• An efficient algorithm for the all pairs suffix-prefix problem
• Fast Pattern Matching in Strings
• Linear approximation of shortest superstrings
• Approximating Shortest Superstrings

This page was built for publication: Faster implementation of a shortest superstring approximation