eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2018-01-05
10:1
10:5
10.4230/OASIcs.SOSA.2018.10
article
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
Kopelowitz, Tsvi
Porat, Ely
The algorithmic task of computing the Hamming distance between a given pattern of length m and each location in a text of length n, both over a general alphabet \Sigma, is one of the most fundamental algorithmic tasks in string algorithms. The fastest known runtime for exact computation is \tilde O(n\sqrt m). We recently introduced a complicated randomized algorithm for obtaining a (1 +/- eps) approximation for each location in the text in O( (n/eps) log(1/eps) log n log m log |\Sigma|) total time, breaking a barrier that stood for 22 years. In this paper, we introduce an elementary and simple randomized algorithm that takes O((n/eps) log n log m) time.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol061_sosa2018/OASIcs.SOSA.2018.10/OASIcs.SOSA.2018.10.pdf
Pattern Matching
Hamming Distance
Approximation Algorithms