Compact directed acyclic word graphs for a sliding window
From MaRDI portal
Publication:876704
Recommendations
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 2052919 (Why is no real title available?)
- scientific article; zbMATH DE number 1786457 (Why is no real title available?)
- scientific article; zbMATH DE number 1929950 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Complete inverted files for efficient text retrieval and analysis
- On-line construction of suffix trees
Cited in
(11)- Compact morphic directed acyclic word graphs
- On-line suffix tree construction with reduced branching
- Truncated suffix trees and their application to data compression.
- Compressed directed acyclic word graph with application in local alignment
- scientific article; zbMATH DE number 2052919 (Why is no real title available?)
- Weighted automata for full-text indexing
- On-line construction of compact directed acyclic word graphs
- On the Structure of Consistent Partitions of Substring Set of a Word
- Ternary directed acyclic word graphs
- Sliding suffix tree
- How much is that DAWG in the window? a moving window algorithm for the directed acyclic word graph
This page was built for publication: Compact directed acyclic word graphs for a sliding window
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876704)