From coding theory to efficient pattern matching
From MaRDI portal
Recommendations
Cited in
(20)- Approximate pattern matching with \(k\)-mismatches in packed text
- On the hardness of optimal vertex relabeling and restricted vertex relabeling
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Efficient sampling of non-strict turnstile data streams
- Set intersection and sequence matching with mismatch counting
- String Matching: Communication, Circuits, and Learning.
- Pattern matching with wildcards using words of shorter length
- Hardness of comparing two run-length encoded strings
- Streaming pattern matching with \(d\) wildcards
- Pattern matching under polynomial transformation
- Verifiable stream computation and Arthur-Merlin communication
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Longest common extensions with wildcards: trade-off and applications
- Pattern matching with mismatches and wildcards
- On pattern matching with \(k\) mismatches and few don't cares
- Mismatch sampling
- Streaming periodicity with mismatches
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- A simple algorithm for approximating the text-to-pattern Hamming distance
- On string matching with mismatches
This page was built for publication: From coding theory to efficient pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633890)
