Dictionary matching with uneven gaps
From MaRDI portal
Recommendations
Cites work
- A data structure for dynamic trees
- A fast string searching algorithm
- An improved query time for succinct dynamic dictionary matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressing dictionary matching index via sparsification technique
- Dictionary matching and indexing with errors and don't cares
- Dictionary matching with one gap
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- Fast Pattern Matching in Strings
- Faster compressed dictionary matching
- Filtering Search: A New Approach to Query-Answering
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- Improved dynamic dictionary matching
- Indexing compressed text
- Orthogonal range searching on the RAM, revisited
- Space Efficient Multi-dimensional Range Reporting
- Succinct Dictionary Matching with No Slowdown
- Suffix Arrays: A New Method for On-Line String Searches
- Text Indexing and Dictionary Matching with One Error
Cited in
(12)- Dictionary matching with a bounded gap in pattern or in text
- Online recognition of dictionary with one gap
- Parameterized dictionary matching and recognition with one gap
- Dictionary matching with a few gaps
- Mind the gap!
- INDEXING GAPPED-FACTORS USING A TREE
- Dictionary matching and indexing with errors and don't cares
- String matching with variable length gaps
- Online matching of multiple regular patterns with gaps and character classes
- Dictionary matching with one gap
- Indexing Factors with Gaps
- Scoring unusual words with varying mismatch errors
This page was built for publication: Dictionary matching with uneven gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942261)