A note on randomized algorithm for string matching with mismatches

Authors:
Kensuke Baba;Ayumi Shinohara;Masayuki Takeda;Shunsuke Inenaga;Setsuo Arikawa
Affiliations:
PRESTO, Japan Science and Technology Corporation, Kawaguchi City, Saitama Prefecture 332-0012, Japan;PRESTO, Japan Science and Technology Corporation, Kawaguchi City, Saitama Prefecture 332-0012, Japan and Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan;PRESTO, Japan Science and Technology Corporation, Kawaguchi City, Saitama Prefecture 332-0012, Japan and Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan;Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan;Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan
Venue:
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Year:
2003

Citing 6
Cited 1

Generalized string matching

SIAM Journal on Computing
A new approach to text searching

Communications of the ACM
Fast algorithms for approximately counting mismatches

Information Processing Letters
Text algorithms

Text algorithms
Fast and practical approximate string matching

Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology

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

String matching with mismatches by real-valued FFT

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

Atallah et al. introduced a randomized algorithm for string matching with mismatches, which utilized fast Fourier transformation (FFT) to compute convolution. It estimates the score vector of matches between text string and a pattern string, that is, the vector obtained when the pattern is slid along the text and the number of matches is counted for each position. In this paper, we simplify the algorithm and give an exact analysis of the variance of the estimator.