Lower bounds for embedding edit distance into normed spaces

A. Andoni, M. Deza, A. Gupta, P. Indyk, S. Raskhodnikova

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)

Abstract

Several computational experiments were performed to improve the lower bound of 3/2. As a result, it was possible to estimate the distortion for embedding of the edit metric over binary strings of length up to d into l1 or square of l2, for small values of d.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
EditorsJ Schewel
Pages523-526
Number of pages4
StatePublished - 2003
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: Nov 2 1998Nov 3 1998

Other

OtherConfiguralble Computing: Technology and Applications
CountryUnited States
CityBoston, MA
Period11/2/9811/3/98

Fingerprint

Edit Distance
Normed Space
Computational Experiments
Strings
Binary
Lower bound
Metric
Estimate
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Cite this

Andoni, A., Deza, M., Gupta, A., Indyk, P., & Raskhodnikova, S. (2003). Lower bounds for embedding edit distance into normed spaces. In J. Schewel (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 523-526)
Andoni, A. ; Deza, M. ; Gupta, A. ; Indyk, P. ; Raskhodnikova, S. / Lower bounds for embedding edit distance into normed spaces. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / J Schewel. 2003. pp. 523-526
@inproceedings{d77e1249f06f45dbba3637999b1bb367,
title = "Lower bounds for embedding edit distance into normed spaces",
abstract = "Several computational experiments were performed to improve the lower bound of 3/2. As a result, it was possible to estimate the distortion for embedding of the edit metric over binary strings of length up to d into l1 or square of l2, for small values of d.",
author = "A. Andoni and M. Deza and A. Gupta and P. Indyk and S. Raskhodnikova",
year = "2003",
language = "English (US)",
pages = "523--526",
editor = "J Schewel",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

}

Andoni, A, Deza, M, Gupta, A, Indyk, P & Raskhodnikova, S 2003, Lower bounds for embedding edit distance into normed spaces. in J Schewel (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 523-526, Configuralble Computing: Technology and Applications, Boston, MA, United States, 11/2/98.

Lower bounds for embedding edit distance into normed spaces. / Andoni, A.; Deza, M.; Gupta, A.; Indyk, P.; Raskhodnikova, S.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / J Schewel. 2003. p. 523-526.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Lower bounds for embedding edit distance into normed spaces

AU - Andoni, A.

AU - Deza, M.

AU - Gupta, A.

AU - Indyk, P.

AU - Raskhodnikova, S.

PY - 2003

Y1 - 2003

N2 - Several computational experiments were performed to improve the lower bound of 3/2. As a result, it was possible to estimate the distortion for embedding of the edit metric over binary strings of length up to d into l1 or square of l2, for small values of d.

AB - Several computational experiments were performed to improve the lower bound of 3/2. As a result, it was possible to estimate the distortion for embedding of the edit metric over binary strings of length up to d into l1 or square of l2, for small values of d.

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

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

M3 - Conference contribution

SP - 523

EP - 526

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Schewel, J

ER -

Andoni A, Deza M, Gupta A, Indyk P, Raskhodnikova S. Lower bounds for embedding edit distance into normed spaces. In Schewel J, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2003. p. 523-526