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 Σ, is one of the most fundamental algorithmic tasks in string algorithms. The fastest known runtime for exact computation is Õ(n √m). We recently introduced a complicated randomized algorithm for obtaining a 1 ± ∈ approximation for each location in the text in O(n/∈ log 1/∈ log n log m log |Σ|) 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/∈ log n log m) time.
|Title of host publication||1st Symposium on Simplicity in Algorithms, SOSA 2018 - Co-located with the 29th ACM-SIAM Symposium on Discrete Algorithms, SODA 2018|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - 1 Jan 2018|
|Event||1st Symposium on Simplicity in Algorithms, SOSA 2018 - New Orleans, United States|
Duration: 7 Jan 2018 → 10 Jan 2018
|Name||OpenAccess Series in Informatics|
|Conference||1st Symposium on Simplicity in Algorithms, SOSA 2018|
|Period||7/01/18 → 10/01/18|
Bibliographical noteFunding Information:
This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 683064).
© Tsvi Kopelowitz and Ely Porat.
- Approximation algorithms
- Hamming distance
- Pattern matching