We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last $n$ symbols of a stream. We give a lower bound of Omege(delta/w log n) time on average per output, where delta is the number of bits needed to represent an input symbol. We argue that this bound is tight within the model. The lower bound holds under randomisation and amortisation.
|Title of host publication||Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, January 6-8, 2013.|
|Place of Publication||New Orleans|
|Publisher||Society for Industrial and Applied Mathematics|
|Publication status||Published - Jan 2013|
- lower bounds
- pattern matching