Homomorphic fingerprints under misalignments: Sketching edit and shift distances

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 931-940

  Andoni, Alexandr ^a   Goldberger, Assaf ^b   McGregor, Andrew ^c   Poraty, Ely ^d  

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

^d UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Edit distance; Fingerprinting; Lower bounds; Sketching

Indexed keywords

DISSIMILARITY MEASURES; EDIT DISTANCE; FINGERPRINTING; LOSSY COMPRESSIONS; LOW-DISTORTION EMBEDDINGS; LOWER BOUNDS; RANDOM PROJECTIONS; SKETCHING;

ALIGNMENT; ERRORS; HAMMING DISTANCE;

COMPUTATION THEORY;

EID: 84879823474     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488726     Document Type: Conference Paper

References (47)

1. P. K. Agarwal, G. Cormode, Z. Huang, J. M. Phillips, Z. Wei, and K. Yi. Mergeable summaries. In PODS, pages 23-34, 2012.
2. K. J. Ahn, S. Guha, and A. McGregor. Analyzing graph structure via linear measurements. In SODA, pages 459-467, 2012.
3. K. J. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In PODS, pages 5-14, 2012.
4. A. Andoni, P. Indyk, and R. Krauthgamer. Earth mover distance over high-dimensional spaces. In SODA, pages 343-352, 2008.
5. A. Andoni, R. Krauthgamer, and K. Onak. Polylogarithmic approximation for edit distance and the asymmetric query complexity. In FOCS, 2010. A full version is available at arxiv.org/abs/1005.4033.
6. Y. Bachrach and R. Herbrich. Fingerprinting ratings for collaborative filtering -theoretical and empirical analysis. In String Processing and Information Retrieval, pages 25-36. Springer, 2010.
7. Y. Bachrach and E. Porat. Fast pseudo-random fingerprints. arXiv preprint arXiv:1009.5791, 2010.
8. Y. Bachrach, E. Porat, and J. S. Rosenschein. Sketching techniques for collaborative filtering. In Proceedings of the 21st international joint conference on Artificial intelligence, pages 2016-2021. Morgan Kaufmann Publishers Inc., 2009.
9. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance eficiently. In FOCS, pages 550-559, 2004.
10. T. Batu, F. Ergün, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, and R. Sami. A sublinear algorithm for weakly approximating edit distance. In STOC, pages 316-324, 2003.
11. T. Batu, F. Ergün, and C. Sahinalp. Oblivious string embeddings and edit distance approximations. In SODA, pages 792-801, 2006.
12. E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52:489-509, 2006.
13. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Proc. of ICALP, 2002.
14. R. Clioörd, K. Efremenko, E. Porat, and A. Rothschild. k -mismatch with don't cares. In ESA, pages 151{162, 2007.
15. R. Cliörd, K. Efremenko, E. Porat, and A. Rothschild. From coding theory to eficient pattern matching. In SODA, pages 778-784, 2009.
16. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005.
17. G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In SODA, pages 197-206, 2000.
18. M. S. Crouch and A. McGregor. Periodicity and cyclic shifts via linear sketches. In APPROX-RANDOM, pages 158-170, 2011.
19. D. L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
20. G. Feigenblat, E. Porat, and A. Shiftan. Exponential time improvement for min-wise based algorithms. Information and Computation, 209(4):737-747, 2011.
21. A. C. Gilbert, Y. Li, E. Porat, and M. J. Strauss. Approximate sparse recovery: optimizing time and measurements. In STOC, pages 475-484, 2010.
22. D. M. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 1(6):124{138, 1993.
23. G. Hardy and E. Wright. An Introduction to the Theory of Numbers. Oxford Science Publications. Oxford University Press, USA, 1980.
24. P. Indyk. Algorithmic aspects of geometric embeddings (tutorial). In FOCS, pages 10-33, 2001.
25. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. J. ACM, 53(3):307-323, 2006.
26. P. Indyk, A. McGregor, I. Newman, and K. Onak, editors. Open Problems in Data Streams, Property Testing, and Related Topics, 2011. Available at: people.cs.umass.edu/-mcgregor/papers/11- openproblems.pdf.
27. H. Jowhari. Effcient communication protocols for deciding edit distance. In ESA, pages 648-658, 2012.
28. H. Jowhari, M. Saglam, and G. Tardos. Tight bounds for lp samplers, finding duplicates in streams, and related problems. In PODS, pages 49{58, 2011.
29. D. M. Kane, J. Nelson, E. Porat, and D. P. Woodruff. Fast moment estimation in data streams in optimal space. In STOC, pages 745-754, 2011.
30. D. M. Kane, J. Nelson, and D. P. Woodruff. An optimal algorithm for the distinct elements problem. In PODS, pages 41-52, 2010.
31. R. M. Karp and M. O. Rabin. Eficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
32. S. Khot and A. Naor. Nonembeddability theorems via fourier analysis. Mathematische Annalen, 334:821-852, 2006.
33. R. Krauthgamer and Y. Rabani. Improved lower bounds for embeddings into L1. In SODA, pages 1010-1017, 2006.
34. P. Li and A. Christian König. Theory and applications of b-bit minwise hashing. Communications of the ACM-Association for Computing Machinery-CACM, 54(8):101, 2011.
35. J. H. v. Lint. Introduction to Coding Theory. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1982.
36. A. Naor and J. Matoušek. Open problems on embeddings of finite metric spaces. 2011.
37. H. Q. Ngo, E. Porat, C. Ré, and A. Rudra. Worst-case optimal join algorithms: [extended abstract]. In PODS, pages 37-48, 2012.
38. H. Q. Ngo, E. Porat, and A. Rudra. Eficiently decodable error-correcting list disjunct matrices and applications - (extended abstract). In ICALP (1), pages 557-568, 2011.
39. H. Q. Ngo, E. Porat, and A. Rudra. Eficiently decodable compressed sensing by list-recoverable codes and recursion. In STACS, pages 230-241, 2012.
40. R. Ostrovsky and Y. Rabani. Low distortion embedding for edit distance. J. ACM, 54(5), 2007. Preliminary version appeared in STOC'05.
41. B. Porat and E. Porat. Exact and approximate pattern matching in the streaming model. In FOCS, pages 315-323, 2009.
42. E. Porat and O. Lipsky. Improved sketching of hamming distance with error correcting. In CPM, pages 173-182, 2007.
43. E. Porat and A. Rothschild. Explicit non-adaptive combinatorial group testing schemes. In ICALP (1), pages 748-759, 2008.
44. E. Porat and M. J. Strauss. Sublinear time, measurement-optimal, sparse recovery for all. In SODA, pages 1215-1227, 2012.
45. E. Porat and E. Waisbard. Eficient signature scheme for network coding. In ISIT, pages 1987-1991, 2012.
46. R. Rivest. The md5 message-digest algorithm, 1992.
47. J. Sylvester. A method of determining by mere inspection the derivatives from two equations of any degree. Phil. Mag., 16:132-135, 1840.