Recent advances in text-to-pattern distance algorithms
From MaRDI portal
Publication:2106622
Recommendations
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- Approximating Approximate Pattern Matching
- A simple algorithm for approximating the text-to-pattern Hamming distance
- Approximating general metric distances between a pattern and a text
- Pattern matching with pair correlation distance
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- A simple algorithm for approximating the text-to-pattern Hamming distance
- Approximate Hamming distance in a stream
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Approximate matching in the \(L_{\infty }\) metric
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Approximating Approximate Pattern Matching
- Approximating Text-To-Pattern Distance via Dimensionality Reduction
- Approximating general metric distances between a pattern and a text
- Approximating text-to-pattern Hamming distances
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Efficient matching of nonrectangular shapes.
- Efficient string matching with k mismatches
- Exact and Approximate Pattern Matching in the Streaming Model
- Fast algorithms for approximately counting mismatches
- Faster algorithms for string matching with k mismatches
- Generalized String Matching
- Hamming Distance Completeness
- Improved range-summable random variable construction algorithms
- On approximate pattern matching with thresholds
- Optimal space lower bounds for all frequency moments
- Pattern matching in the Hamming distance with thresholds
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- The \(k\)-mismatch problem revisited
- The one-way communication complexity of Hamming distance
- The streaming \(k\)-mismatch problem
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- \(L_{1}\) pattern matching lower bound
This page was built for publication: Recent advances in text-to-pattern distance algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106622)
