Recommendations
- Ternary directed acyclic word graphs
- Compact morphic directed acyclic word graphs
- Implementation of directed acyclic word graph.
- Combinatorial Pattern Matching
- Structural properties of word representable graphs
- Compact directed acyclic word graphs for a sliding window
- Acyclic digraphs
- Trie structure for graph sequences
Cites work
- scientific article; zbMATH DE number 1786457 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 6472611 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Approximate string matching with suffix automata
- Complete inverted files for efficient text retrieval and analysis
- Jewels of Stringology
- Minimisation of acyclic deterministic automata in linear time
- On-line construction of suffix trees
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
Cited in
(6)- On the Structure of Consistent Partitions of Substring Set of a Word
- Ternary directed acyclic word graphs
- scientific article; zbMATH DE number 1962793 (Why is no real title available?)
- Compact morphic directed acyclic word graphs
- Weighted automata for full-text indexing
- An algorithm for dynamic processing of dawg's
This page was built for publication: Ternary directed acyclic word graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703500)