DAWG versus suffix array

DOI10.1007/3-540-44977-9_23MaRDI QIDQ4418620zbMATH OpenFDO

Authors Miroslav Balík

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/26080233.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Implementation of directed acyclic word graph.
• How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
• On the implementation of compact DAWG's
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Theory and Applications of Models of Computation

Cited in

(8)

• Suffix trees, DAWGs and CDAWGs for forward and backward tries
• Compressed directed acyclic word graph with application in local alignment
• Implementation of directed acyclic word graph.
• How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
• On-line construction of compact directed acyclic word graphs
• Computing DAWGs and minimal absent words in linear time for integer alphabets
• An algorithm for dynamic processing of dawg's
• Theory and Applications of Models of Computation

This page was built for publication: DAWG versus suffix array

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