Results 1 -
3 of
3
A Note on Randomized Algorithm for String Matching with Mismatches
- In Proceedings of the Prague Stringology Conference ’02 (PSC’02
, 2002
"... Atallah et al. [ACD01] 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, i.e. the vector obtained when the pattern is slid ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Atallah et al. [ACD01] 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, i.e. 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. Key words: Pattern matching, mismatch, FFT, convolution, randomized algorithm 1
Robust String Matching in O(√N +m) Quantum Queries
, 2003
"... Finding a match of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best ..."
Abstract
- Add to MetaCart
Finding a match of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best
