Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance

DOI10.1137/1.9781611977554.CH188MaRDI QIDQ6538719zbMATH OpenFDO

Authors Michal Koucký, Michael Saks

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH188

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Small-space algorithms for the online language distance problem for palindromes and squares

This page was built for publication: Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance

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