Sciweavers

ICCSA
2010
Springer

String Matching with Mismatches by Real-Valued FFT

13 years 10 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.
Kensuke Baba
Added 18 May 2010
Updated 18 May 2010
Type Conference
Year 2010
Where ICCSA
Authors Kensuke Baba
Comments (0)