Oblivious string embeddings and edit distance approximations

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 792-801

  Batu, Tuǧkan ^a   Ergun, Funda ^a   Sahinalp, Cenk ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE APPROXIMATIONS; OBLIVIOUS STRING EMBEDDINGS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PARAMETER ESTIMATION;

EMBEDDED SYSTEMS;

EID: 33244477910     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109644     Document Type: Conference Paper

References (13)

1. A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova. Lower bounds for embedding edit distance into normed spaces. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
2. Z. Bar-Yossef, T. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance efficiently. In IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
3. 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 ACM Symposium on Theory of Computing, (STOC), 2003.
4. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms. In ACM Symposium on Theory of Computing (STOC), 1986.
5. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, May 1984.
6. S. Khot and A. Naor. Nonembeddability theorems via Fourier analysis. In IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
7. 1-embeddings of the edit distance. Unpublished manuscript, 2005.
8. W. J. Masek and M. S. Paterson. A faster algorithm computing string edit distances. Journal of Computer and System Sciences, 20(1):18-31, February 1980.
9. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, 1976.
10. R. Ostrovsky and Y. Rabani. Low distortion embeddings for edit distance. In ACM Symposium on Theory of Computing (STOC), 2005.
11. S. C. Sahinalp and U. Vishkin. Data compression using locally consistent parsing. UMIACS Technical Report, 1995.
12. S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In IEEE Symposium on Foundations of Computer Science (FOCS), 1996.
13. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing, 17(6):1253-1262, December 1988.