Metraipolis › archive › dc_f563e6bedcec

Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time — arXiv:2609.20796

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20796
License (as archived)
CC0-1.0
Archived
2026-10-10T05:44:47.923Z
SHA-256 of the archived text
58afa45049e8cb471cec7cc9015a17ee3b5a785e1f19741d40978c9dd175eb09
Stable URL of this page
https://metraipolis.com/documento/dc_f563e6bedcec

How to cite

Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time — arXiv:2609.20796 — arXiv (en), https://arxiv.org/abs/2609.20796 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f563e6bedcec (Metraipolis archive dc_f563e6bedcec, sha256 58afa45049e8cb471cec7cc9015a17ee3b5a785e1f19741d40978c9dd175eb09)
BibTeX
@misc{dcf563e6bedcec,
  title = {Metric Weighted Edit Distance: $(3+varepsilon)$-Approximation in $widetilde O_varepsilon(N^1.6)$ Time — arXiv:2609.20796},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20796},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f563e6bedcec; sha256 58afa45049e8cb471cec7cc9015a17ee3b5a785e1f19741d40978c9dd175eb09},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20796. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For every $0 < \varepsilon \le 1$, we give a randomized $(3+\varepsilon)$-approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap symbol. For strings of total length $N$, the running time is $\widetilde{O}(N^{8/5}/\varepsilon^{16/5})$, where $\widetilde{O}$ suppresses factors polynomial in $\log(N/\varepsilon)$. The dependence on $N$ matches that of the fastest known $(3+\varepsilon)$-approximation for unit-cost edit distance. The algorithm never underestimates the edit distance and achieves the approximation guarantee with inverse-polynomial failure probability in $N$. The running time bound assumes constant-time exact arithmetic operations and metric queries, and it is independent of the numerical range of the edit costs. We build on three tools: the sampling framework of Chakraborty, Das, Goldenberg, Koucký, and Saks (J. ACM, 2020), with subsequent refinements by Andoni (2020); Kuszmaul's removal of inexpensive characters (ICALP 2019); and Klein's data structure for distances in planar graphs (SODA 2005). Our new ingredients include, among others, a decomposition of one string into pieces of bounded length with highly structured total deletion costs. This decomposition lets us compare all pieces against a small family of substrings of the other string.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.20796 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T05:08:06.578Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).