<conference paper>
A Note on Randomized Algorithm for String Matching with Mismatches

Creator
Language
Publisher
Date
Source Title
Vol
First Page
Last Page
Publication Type
Access Rights
Related DOI
Related URI
Relation
Abstract Atallah et al. [2] introduced a randomized algorithm for string matching with mismatches, which utilized fast Fourier transformation (FFT) to compute convolution. It estimates the score vector of matc...hes 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. This paper simplifies the algorithm and give an exact analysis of the variance of the estimator.show more

Hide fulltext details.

pdf BSTIA02 pdf 170 KB 255  

Details

Record ID
Peer-Reviewed
Subject Terms
Notes
Created Date 2009.10.15
Modified Date 2020.12.08

People who viewed this item also viewed