Approximating text-to-pattern Hamming distances

DOI10.1145/3357713.3384266OpenAlexW3034478696MaRDI QIDQ5144951

Shay Golan, Timothy M. Chan, Tsvi Kopelowitz, Tomasz Kociumaka, Ely Porat

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00211

zbMATH Keywords

samplingHamming distancesublinearpattern matchingproperty testingstreaming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Exploiting pseudo-locality of interchange distance ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Circular pattern matching with \(k\) mismatches ⋮ Recent advances in text-to-pattern distance algorithms

This page was built for publication: Approximating text-to-pattern Hamming distances