Breaking the O(n)-barrier in the construction of compressed suffix arrays and suffix trees

DOI10.1137/1.9781611977554.CH187MaRDI QIDQ6538718zbMATH OpenFDO

Authors Dominik Kempa, Tomasz Kociumaka

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Substring complexity in sublinear space
• Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching

This page was built for publication: Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees

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