Real-Time Streaming Multi-Pattern Search for Constant Alphabet
From MaRDI portal
Publication:5111729
DOI10.4230/LIPICS.ESA.2017.41zbMATH Open1442.68280OpenAlexW2760452898MaRDI QIDQ5111729FDOQ5111729
Publication date: 27 May 2020
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2017/7855/pdf/LIPIcs-ESA-2017-41.pdf/
Recommendations
- Full-fledged real-time indexing for constant size alphabets
- Full-fledged real-time indexing for constant size alphabets
- Real-time streaming string-matching
- Real-time streaming string-matching
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
- CSA++: Fast Pattern Search for Large Alphabets
- Simple real-time constant-space string matching
- Simple real-time constant-space string matching
Cites Work
- The space complexity of approximating the frequency moments
- Efficient string matching
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Fast moment estimation in data streams in optimal space
- Title not available (Why is that?)
- Constructing Efficient Dictionaries in Close to Sorting Time
- Simple real-time constant-space string matching
- Theory and practice of monotone minimal perfect hashing
- Title not available (Why is that?)
- Deterministic dictionaries
- Addendum to: ``Exponential time improvement for min-wise based algorithms
- The k-mismatch problem revisited
- Exact and Approximate Pattern Matching in the Streaming Model
- Real-Time Streaming String-Matching
- Periodicity in Streams
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Dictionary matching with a few gaps
- Dictionary Matching with One Gap
- An Improved Query Time for Succinct Dynamic Dictionary Matching
- Title not available (Why is that?)
- Dictionary Matching in a Stream
- Streaming Pattern Matching with d Wildcards
- Fast circular dictionary-matching algorithm
- Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
- A Framework for Dynamic Parameterized Dictionary Matching
- Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.
- Title not available (Why is that?)
- GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU
- An Efficient TCAM-Based Implementation of Multipattern Matching Using Covered State Encoding
Cited In (8)
- Streaming dictionary matching with mismatches
- Streaming \(k\)-mismatch with error correcting and applications
- Streaming pattern matching with \(d\) wildcards
- CSA++: Fast Pattern Search for Large Alphabets
- Compressed Multiple Pattern Matching
- Searching Long Repeats in Streams
- Streaming Dictionary Matching with Mismatches
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
This page was built for publication: Real-Time Streaming Multi-Pattern Search for Constant Alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111729)
