For a preprocessed pattern of length $m$ and a streaming text, we give two algorithms that estimate the Hamming distance at every alignment to relative error $\varepsilon$. They use $\varepsilon^{-8/5}m^{2/5+o(1)}$ and $\varepsilon^{-1} m^{1/2+o(1)}$ words of space, respectively, including all retained pattern information. Each estimate is reported as soon as its window ends, and all estimates are simultaneously correct with high probability. The prior space bounds are $\widetilde{O}(\varepsilon^{-3/2}\sqrt{m})$, due to Chan et al. [CGK+20], and $\widetilde{O}((m/\varepsilon)^{2/3})$, a consequence of their results and those of Clifford, Kociumaka, and Porat [CKP18]. For $\varepsilon=Θ(m^{-a})$, the better of our two bounds improves on both prior space exponents for every fixed $0<a<1/2$. A Fourier matcher uses $\widetilde{O}(\varepsilon^{-2}(m/K)^2)$ words to estimate each distance $d$ within $\varepsilon(d+K)$, giving relative error at most $2\varepsilon$ for $d\ge K$. A threshold matcher based on random-prime residue refinements and the multi-stream dictionary matching algorithm of Golan, Kopelowitz, and Porat [GKP18] gives our second space bound directly. Combining it with the Fourier matcher gives the first. Both space bounds extend to $L_1$ matching over polynomially bounded integer symbols.
翻译:暂无翻译