Recent advances in text-to-pattern distance algorithms
type: Item
instance of: scholarly article
title: Recent advances in text-to-pattern distance algorithms
DOI: 10.1007/978-3-030-51466-2_32
author: Przemysław Uznański
publication date: 2022-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633523
MaRDI profile type: Publication
full work available at URL: 978-3-030-51466-2 32
OpenAlex ID: W3037883011
cites work: Generalized String Matching
cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
cites work: Efficient matching of nonrectangular shapes.
cites work: Faster algorithms for string matching with k mismatches
cites work: Combinatorial Pattern Matching
cites work: Pattern matching in the Hamming distance with thresholds
cites work: Improved range-summable random variable construction algorithms
cites work: An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
cites work: Approximating text-to-pattern Hamming distances
cites work: Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
cites work: The k-mismatch problem revisited
cites work: The streaming k-mismatch problem
cites work: Approximate Hamming Distance in a Stream
cites work: Q4055156
cites work: Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance
cites work: Stable distributions, pseudorandom generators, embeddings, and data stream computation
cites work: Q3002795
cites work: Fast algorithms for approximately counting mismatches
cites work: A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
cites work: Hamming Distance Completeness
cites work: Efficient string matching with k mismatches
cites work: Approximate matching in the \(L_{\infty }\) metric
cites work: \(L_{1}\) pattern matching lower bound
cites work: Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
cites work: Exact and Approximate Pattern Matching in the Streaming Model
cites work: Q3579401
cites work: Approximating Approximate Pattern Matching
cites work: Q5601777
cites work: Approximating Text-To-Pattern Distance via Dimensionality Reduction
cites work: Q5501255
cites work: On approximate pattern matching with thresholds
description: scientific article; zbMATH DE number 7633523