Sublinear-time algorithms for computing \& embedding gap edit distance

DOI10.1109/FOCS46700.2020.00112MaRDI QIDQ6943943zbMATH OpenFDO

Authors Tomasz Kociumaka, Barna Saha

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00112

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Approximation algorithms for LCS and LIS with truly improved running times
• Range counting oracles for geometric problems
• Edit distance in near-linear time: it's a constant factor

This page was built for publication: Sublinear-time algorithms for computing \& embedding gap edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943943)