Streaming Dictionary Matching with Mismatches

DOI10.4230/LIPICS.CPM.2019.21OpenAlexW4392970069MaRDI QIDQ5088912

Paweł Gawrychowski, Tatiana Starikovskaya

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1809.02517

zbMATH Keywords

Hamming distancestreamingmultiple pattern matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Streaming dictionary matching with mismatches

Cites Work

• Unnamed Item
• Unnamed Item
• On randomized one-round communication complexity
• Fast practical multi-pattern matching
• Faster compressed dictionary matching
• Worst Case Efficient Single and Multiple String Matching in the RAM Model
• 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
• Fast Prefix Search in Little Space, with Applications
• Efficient randomized pattern-matching algorithms
• Efficient string matching
• The k-mismatch problem revisited
• Average Optimal String Matching in Packed Strings
• Real-Time Streaming String-Matching
• Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
• Multiple approximate string matching
• 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.

This page was built for publication: Streaming Dictionary Matching with Mismatches