How compression and approximation affect efficiency in string distance measures

DOI10.1137/1.9781611977073.112MaRDI QIDQ6575187zbMATH OpenFDO

Authors Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Core-sparse Monge matrix multiplication: improved algorithm and applications

This page was built for publication: How compression and approximation affect efficiency in string distance measures

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