Dictionary matching with a bounded gap in pattern or in text
From MaRDI portal
Publication:1709592
DOI10.1007/s00453-017-0288-2zbMath1391.68129OpenAlexW2586996921WikidataQ58062844 ScholiaQ58062844MaRDI QIDQ1709592
Rahul Shah, Sharma V. Thankachan, Yilin Yang, Hing-Fung Ting, Tak-Wah Lam, Wing-Kai Hon
Publication date: 6 April 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0288-2
Related Items
Online parameterized dictionary matching with one gap, Online recognition of dictionary with one gap, Parameterized dictionary matching and recognition with one gap, A comparative study of dictionary matching with gaps: limitations, techniques and challenges
Cites Work
- A faster algorithm for matching a set of patterns with variable length don't cares
- Matching a set of strings with variable length don't cares
- A data structure for dynamic trees
- Improved dynamic dictionary matching
- Faster compressed dictionary matching
- Dictionary matching with a few gaps
- Compressing dictionary matching index via sparsification technique
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- Succinct Dictionary Matching with No Slowdown
- Dictionary matching and indexing with errors and don't cares
- Filtering Search: A New Approach to Query-Answering
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- Fast Pattern Matching in Strings
- Text Indexing and Dictionary Matching with One Error
- Dictionary Matching with One Gap
- An Improved Query Time for Succinct Dynamic Dictionary Matching
- Space Efficient Multi-dimensional Range Reporting
- Orthogonal range searching on the RAM, revisited
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
