Improved sketching of hamming distance with error correcting

Ely Porat; Ohad Lipsky

doi:10.1007/978-3-540-73437-6_19

Improved sketching of hamming distance with error correcting

Ely Porat, Ohad Lipsky

Department of Computer Science

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

29 Scopus citations

Abstract

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 language	English
Title of host publication	Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings
Publisher	Springer Verlag
Pages	173-182
Number of pages	10
ISBN (Print)	9783540734369
DOIs	https://doi.org/10.1007/978-3-540-73437-6_19
State	Published - 2007
Event	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 - London, ON, Canada Duration: 9 Jul 2007 → 11 Jul 2007

Publication series

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

Conference

Conference	18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007
Country/Territory	Canada
City	London, ON
Period	9/07/07 → 11/07/07

Access to Document

10.1007/978-3-540-73437-6_19

Cite this

Porat, E., & Lipsky, O. (2007). Improved sketching of hamming distance with error correcting. In Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings (pp. 173-182). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73437-6_19

@inproceedings{6109756411fb4db3a08d7f125cc0dd75,

title = "Improved sketching of hamming distance with error correcting",

abstract = "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.",

author = "Ely Porat and Ohad Lipsky",

year = "2007",

doi = "10.1007/978-3-540-73437-6_19",

language = "אנגלית",

isbn = "9783540734369",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "173--182",

booktitle = "Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings",

address = "גרמניה",

note = "18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007 ; Conference date: 09-07-2007 Through 11-07-2007",

}

Porat, E & Lipsky, O 2007, Improved sketching of hamming distance with error correcting. in Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4580 LNCS, Springer Verlag, pp. 173-182, 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007, London, ON, Canada, 9/07/07. https://doi.org/10.1007/978-3-540-73437-6_19

Improved sketching of hamming distance with error correcting. / Porat, Ely; Lipsky, Ohad.
Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings. Springer Verlag, 2007. p. 173-182 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4580 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improved sketching of hamming distance with error correcting

AU - Porat, Ely

AU - Lipsky, Ohad

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=37849042296&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73437-6_19

DO - 10.1007/978-3-540-73437-6_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:37849042296

SN - 9783540734369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 182

BT - Combinatorial Pattern Matching - 18th Annual Symposium, CPM 2007, Proceedings

PB - Springer Verlag

T2 - 18th Annual Symposium on Combinatorial Pattern Matching, CPM 2007

Y2 - 9 July 2007 through 11 July 2007

ER -

Improved sketching of hamming distance with error correcting

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this