Streaming dictionary matching with mismatches
From MaRDI portal
Publication:2118382
DOI10.1007/s00453-021-00876-xOpenAlexW3206234420MaRDI QIDQ2118382
Tatiana Starikovskaya, Paweł Gawrychowski
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10492/
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Fast index for approximate string matching
- Approximate string matching using compressed suffix arrays
- Improved approximate string matching using compressed suffix data structures
- Efficient string matching with k mismatches
- Fast practical multi-pattern matching
- Faster compressed dictionary matching
- Dynamic dictionary matching in the online model
- Languages with mismatches
- Dictionary Matching in a Stream
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Succinct Dictionary Matching with No Slowdown
- Dictionary matching and indexing with errors and don't cares
- Efficient randomized pattern-matching algorithms
- Efficient string matching
- The k-mismatch problem revisited
- Faster algorithms for string matching with k mismatches
- Average Optimal String Matching in Packed Strings
- Real-Time Streaming String-Matching
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
- Compressed Multiple Pattern Matching
- Streaming Dictionary Matching with Mismatches
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Exact and Approximate Pattern Matching in the Streaming Model
- The streaming k-mismatch problem
- Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.
