Recent advances in text-to-pattern distance algorithms
From MaRDI portal
Publication:2106622
DOI10.1007/978-3-030-51466-2_32OpenAlexW3037883011MaRDI QIDQ2106622
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_32
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximate pattern matching with thresholds
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Efficient string matching with k mismatches
- Fast algorithms for approximately counting mismatches
- Efficient matching of nonrectangular shapes.
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Pattern matching in the Hamming distance with thresholds
- Approximate matching in the \(L_{\infty }\) metric
- \(L_{1}\) pattern matching lower bound
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
- Generalized String Matching
- The k-mismatch problem revisited
- Approximate Hamming Distance in a Stream
- Faster algorithms for string matching with k mismatches
- An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
- Hamming Distance Completeness
- Approximating Approximate Pattern Matching
- Approximating text-to-pattern Hamming distances
- Exact and Approximate Pattern Matching in the Streaming Model
- The streaming k-mismatch problem
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Approximating Text-To-Pattern Distance via Dimensionality Reduction
This page was built for publication: Recent advances in text-to-pattern distance algorithms
