跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24768 · v1

Small-Space Streaming Hamming Approximation

首次提交 2026-11-19 01:18
版本更新 2026-11-19 01:18
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

For a preprocessed pattern of length mm and a streaming text, we give two algorithms that estimate the Hamming distance at every alignment to relative error ε\varepsilon. They use ε−8/5m2/5+o(1)\varepsilon^{-8/5}m^{2/5+o(1)} and ε−1m1/2+o(1)\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 O~(ε−3/2m)\widetilde{O}(\varepsilon^{-3/2}\sqrt{m}), due to Chan et al. [CGK+20], and O~((m/ε)2/3)\widetilde{O}((m/\varepsilon)^{2/3}), a consequence of their results and those of Clifford, Kociumaka, and Porat [CKP18]. For ε=Θ(m−a)\varepsilon=Θ(m^{-a}), the better of our two bounds improves on both prior space exponents for every fixed 0<a<1/20<a<1/2. A Fourier matcher uses O~(ε−2(m/K)2)\widetilde{O}(\varepsilon^{-2}(m/K)^2) words to estimate each distance dd within ε(d+K)\varepsilon(d+K), giving relative error at most 2ε2\varepsilon for d≥Kd\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 L1L_1 matching over polynomially bounded integer symbols.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 01:18 · 最新观测版本

Small-Space Streaming Hamming Approximation

For a preprocessed pattern of length mm and a streaming text, we give two algorithms that estimate the Hamming distance at every alignment to relative error ε\varepsilon. They use ε−8/5m2/5+o(1)\varepsilon^{-8/5}m^{2/5+o(1)} and ε−1m1/2+o(1)\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 O~(ε−3/2m)\widetilde{O}(\varepsilon^{-3/2}\sqrt{m}), due to Chan et al. [CGK+20], and O~((m/ε)2/3)\widetilde{O}((m/\varepsilon)^{2/3}), a consequence of their results and those of Clifford, Kociumaka, and Porat [CKP18]. For ε=Θ(m−a)\varepsilon=Θ(m^{-a}), the better of our two bounds improves on both prior space exponents for every fixed 0<a<1/20<a<1/2. A Fourier matcher uses O~(ε−2(m/K)2)\widetilde{O}(\varepsilon^{-2}(m/K)^2) words to estimate each distance dd within ε(d+K)\varepsilon(d+K), giving relative error at most 2ε2\varepsilon for d≥Kd\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 L1L_1 matching over polynomially bounded integer symbols.

查看此版本解读 →查看此版本原文 ↗