String matching with mismatches by real-valued FFT

Authors:
Kensuke Baba
Affiliations:
Research and Development Division, Kyushu University Library, Fukuoka, Japan
Venue:
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2010

Citing 5
Cited 0

Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Introduction to Algorithms

Introduction to Algorithms
A note on randomized algorithm for string matching with mismatches

Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
FFT-based algorithms for the string matching with mismatches problem

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.