Improved sketching of hamming distance with error correcting

Ely Porat, Ohad Lipsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

28 Scopus citations


We address the problem of sketching the hamming distance of data streams. We develop Fixable Sketches which compare data streams or files and restore the differences between them. Our contribution: For two streams with hamming distance bounded by k we show a sketch of size O(k log n) with O(log n) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less than 1/n.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540734369
StatePublished - 2007
Event18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 - London, ON, Canada
Duration: 9 Jul 200711 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4580 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
CityLondon, ON


Dive into the research topics of 'Improved sketching of hamming distance with error correcting'. Together they form a unique fingerprint.

Cite this