Sciweavers

Share
IWOCA
2009
Springer

Fast Convolutions and Their Applications in Approximate String Matching

12 years 8 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The technique is applied to approximate string matching under Hamming distance. The obtained algorithms are the fastest known. In particular, we reduce the complexity of the Amir et al. [1] algorithm for k-mismatches from O(n √ k log k) to O(n + n k/w log k).
Kimmo Fredriksson, Szymon Grabowski
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where IWOCA
Authors Kimmo Fredriksson, Szymon Grabowski
Comments (0)
books