Approximate Nearest Neighbor under Edit Distance via Product Metrics

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 639-643

  Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; PRODUCT METRICS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; VECTORS;

DATA STRUCTURES;

EID: 1842435106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. [ADG+03] A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova. Lower bounds for embedding of edit distance into normed spaces. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2003.
2. [AMN+94] S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 573-582, 1994.
3. [CIP02] Moses Charikar, Piotr Indyk, and Rina Panigrahy. New algorithms for subset query, partial match, orthogonal range searching and related problems. International Colloquium on Automata,Languages, and Programming, 2002.
4. [Cla88] K. Clarkson. A randomized algorithm for closest-point queries. SIAM Journal on Computing, 17:830-847, 1988.
5. [CM02] G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2002.
6. [CPSV00] G. Cormode, M. Paterson, C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2000.
7. [HP01] S. Har-Peled. A replacement for voronoi diagrams of near linear size. Proceedings of the Symposium on Foundations of Computer Science, 2001.
8. [IM98] P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, 1998.
9. ∞ norm. Journal of Computer and System Sciences, to appear. Preliminary version appeared in Proceedings of the Symposium on Foundations of Computer Science, 1998.
10. [Ind00] P. Indyk. Dimensionality reduction techniques for proximity problems. Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 2000.
11. [Ind02] P. Indyk. Approximate nearest neighbor algorithms for frechet metric via product metrics. Symposium on Computational Geometry, 2002.
12. [Kle97] J. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997.
13. [KOR98] E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the Thirtieth ACM Symposium on Theory of Computing, pages 614-623, 1998.
14. [Mei93] S. Meiser. Point location in arrangements of hyperplanes. Information and Computation, 106:286-303, 1993.
15. [MS00] S. Muthukrishnan and C. Sahinalp. Approximate sequence nearest neighbors. Proceedings of the Symposium on Theory of Computing, 2000.