Faster implementation of a shortest superstring approximation

DOI10.1016/0020-0190(94)00097-2MaRDI QIDQ1336759zbMATH OpenOpenAlexFDO

Authors 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) Data structures (68P05) Nonnumerical algorithms (68W05)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An efficient algorithm for the all pairs suffix-prefix problem
• Approximating Shortest Superstrings
• Fast Pattern Matching in Strings
• Linear approximation of shortest superstrings

Cited in

(3)

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

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

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