Pattern matching on grammar-compressed strings in linear time

DOI10.1137/1.9781611977073.110MaRDI QIDQ6575185zbMATH OpenFDO

Authors Moses Ganardi, Paweł Gawrychowski

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Pattern matching on run-length grammar-compressed strings in linear time
• FO-query enumeration over SLP-compressed structures of bounded degree

This page was built for publication: Pattern matching on grammar-compressed strings in linear time

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