On the implementation of compact DAWG's

DOI10.1007/3-540-44977-9_31MaRDI QIDQ4418628zbMATH OpenFDO

Authors Jan Holub, Maxime Crochemore

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2608/26080289.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Implementation of directed acyclic word graph.
• On-line construction of compact directed acyclic word graphs
• Ternary directed acyclic word graphs
• Ternary directed acyclic word graphs
• On-line construction of compact directed acyclic word graphs

Cited in

(10)

• Optimal insertion in deterministic DAWGs
• On-line construction of compact directed acyclic word graphs
• Linear-size suffix tries
• Implementation of directed acyclic word graph.
• Algorithms for indexing highly similar DNA sequences
• Ternary directed acyclic word graphs
• DAWG versus suffix array
• Fast label extraction in the CDAWG
• On Sturmian graphs
• On-line construction of compact suffix vectors and maximal repeats

This page was built for publication: On the implementation of compact DAWG's

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