Dynamic dictionary matching
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3633757 (Why is no real title available?)
- scientific article; zbMATH DE number 194302 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A data structure for dynamic trees
- A fast string searching algorithm
- Efficient string matching
- Fast Pattern Matching in Strings
Cited in
(17)- Two-dimensional dynamic dictionary matching
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Dictionary matching with a few gaps
- Multiple matching of parameterized patterns
- Dynamic dictionary matching with failure functions
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- On updating suffix tree labels
- Online parameterized dictionary matching with one gap
- Parameterized dictionary matching and recognition with one gap
- Dynamic dictionary matching in external memory
- Compressing dictionary matching index via sparsification technique
- Matching a set of strings with variable length don't cares
- Time-optimal top-\(k\) document retrieval
- A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS
- Internal dictionary matching
- A grouping approach for succinct dynamic dictionary matching
- Pattern matching in hypertext
This page was built for publication: Dynamic dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337462)
