A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The streaming k-mismatch problem
[chapter]

2019
*
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
*

General rights This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: Abstract We consider the streaming complexity of a fundamental task in approximate pattern matching: the k-mismatch problem. In this problem, we must compute Hamming distances between a pattern of length n and all length-n substrings of a text for which the Hamming distance does not exceed a given threshold k. In

doi:10.1137/1.9781611975482.68
dblp:conf/soda/CliffordKP19
fatcat:fvx2bf6cfnep3jinkiyuc3r2jm