Efficient algorithms for substring near neighbor problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1203-1212

  Andoni, Alexandr ^a   Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HAMMING DISTANCE; NEAR NEIGHBOR PROBLEM; QUERY TIME;

APPROXIMATION THEORY; DATA STRUCTURES; DISTANCE MEASUREMENT; PROBLEM SOLVING;

ALGORITHMS;

EID: 33244484171     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109690     Document Type: Conference Paper

References (22)

1. [And05] A. Andoni. Approximate Nearest Neighbor Problem in High Dimensions. Master of Engineering Thesis, Massachusetts Institute of Technology, Cambridge, MA, June 2005.
2. [AF95] A Amir and M Farach. Eficient 2-dimensional approximate matching of non-rectangular figures. Information and Computation, 118:1-11, 1995.
3. +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.
4. [BFC00] Michael A. Bender and Martin Farach-Colton. The lca problem revisited. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pages 88-94. Springer-Verlag, 2000.
5. [BT01] J. Buhler and M. Tompa. Finding motifs using random projections. Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB01), 2001.
6. [Buh01] J. Buhler. Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics, 17:419-428, 2001.
7. [Buh02] J. Buhler. Provably sensitive indexing strategies for biosequence similarity search. Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB02), 2002.
8. [CGL04] R. Cole, L.A. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. Annual ACM Symposium on Theory of Computing, pages 91-100, 2004.
9. [DIIM04] M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. Proceedings of the ACM Symposium on Computational Geometry, 2004.
10. [EIV01] A. Efrat, P. Indyk, and S. Venkatasubramanian. Pattern matching for sets of segments. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2001.
11. [Far97] M. Farach. Optimal suffix tree construction with large alphabets. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), page 137. IEEE Computer Society, 1997.
12. [GIM99] A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), 1999.
13. [IKM00] P. Indyk, N. Koudas, and S. Muthukrishnan. Identifying representative trends in massive time series datasets using sketches. Proceedings of the 26th International Conference on Very Large Databases (VLDB), 2000.
14. [IM98] P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, 1998.
15. [Ind98] P. Indyk. Faster algorithms for string matching problems: matching the convolution bound. Annual Symposium on Foundations of Computer Science, 1998.
16. [Ind00] P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Annual Symposium on Foundations of Computer Science, 2000.
17. [JP04] N. C. Jones and P. A. Pevzner. An Introduction to Bioinformatics Algorithms. The MIT Press Cambridge, MA, 2004.
18. [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.
19. [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.
20. [KR87] R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 1987.
21. [MM93] U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 1993.
22. [MS02] S. Muthukrishnan and S. C. Sahinalp. Simple and practical sequence nearest neighbors with block operations. CPM, 2002.