A framework for dynamic parameterized dictionary matching
From MaRDI portal
Recommendations
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Space-efficient dictionaries for parameterized and order-preserving pattern matching
- pBWT: achieving succinct data structures for parameterized pattern matching and related problems
- Fast parameterized matching with \(q\)-grams
- Simpler FM-index for parameterized string matching
Cited in
(19)- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- Online parameterized dictionary matching with one gap
- Parameterized dictionary matching and recognition with one gap
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Simpler FM-index for parameterized string matching
- The parameterized position heap of a trie
- A brief history of parameterized matching problems
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- Alphabet-Independent and Scaled Dictionary Matching
- pBWT: achieving succinct data structures for parameterized pattern matching and related problems
- On the parallel dynamic dictionary matching problem: new results with applications
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Position heaps for parameterized strings
- A prefix array for parameterized strings
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Space-efficient dictionaries for parameterized and order-preserving pattern matching
- DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
- Compressed dictionary matching on run-length encoded strings
- Compressed dictionary matching on run-length encoded strings
This page was built for publication: A framework for dynamic parameterized dictionary matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369512)
