文章基本信息

标题：A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
本地全文：下载
作者：Tsvi Kopelowitz ; Ely Porat
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：61
页码：10:1-10:5
DOI：10.4230/OASIcs.SOSA.2018.10
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Pattern Matching; Hamming Distance; Approximation Algorithms