Dynamic dictionary matching and compressed suffix trees
From MaRDI portal
Recommendations
- Compressed indexes for dynamic text collections
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Combinatorial Pattern Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Space efficient suffix trees
Cited in
(15)- Faster compressed dictionary matching
- Internal dictionary matching
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Compressing dictionary matching index via sparsification technique
- Dynamic suffix tree and two-dimensional texts management
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Compressed indexes for dynamic text collections
- Compressed directed acyclic word graph with application in local alignment
- scientific article; zbMATH DE number 2079422 (Why is no real title available?)
- scientific article; zbMATH DE number 1445339 (Why is no real title available?)
- Compressed Multiple Pattern Matching
- A grouping approach for succinct dynamic dictionary matching
- Combinatorial Pattern Matching
- Succinct online dictionary matching with improved worst-case guarantees
- A Framework for Dynamizing Succinct Data Structures
This page was built for publication: Dynamic dictionary matching and compressed suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921649)
