Approximate Hamming Distance in a Stream

DOI10.4230/LIPIcs.ICALP.2016.20zbMath1388.68321arXiv1602.07241OpenAlexW2278382295MaRDI QIDQ4598153

Raphaël Clifford, Tatiana Starikovskaya

Publication date: 19 December 2017

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

zbMATH Keywords

Hamming distancecommunication complexitydata stream model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Approximation algorithms (68W25) Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (10)

Unnamed Item ⋮ Exploiting pseudo-locality of interchange distance ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Unnamed Item ⋮ Streaming \(k\)-mismatch with error correcting and applications ⋮ Searching Long Repeats in Streams ⋮ Time-homogeneous top-K ranking using tensor decompositions ⋮ Recent advances in text-to-pattern distance algorithms

This page was built for publication: Approximate Hamming Distance in a Stream