Practical Random Access to SLP-Compressed Texts

DOI10.1007/978-3-030-59212-7_16MaRDI QIDQ6485940zbMATH OpenFDO

Authors Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake

Publication date 22 December 2022

Published in 1523.68029 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59212-7_16

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Recommendations

• Random access to grammar-compressed strings and trees
• Grammar compressed sequences with rank/select support
• Random access to grammar-compressed strings
• Self-indexed grammar-based compression
• Grammar-compressed indexes with logarithmic search time

Cited in

(4)

• Grammar Compression by Induced Suffix Sorting
• Rpair: rescaling RePair with Rsync
• Improved pangenomic classification accuracy with chain statistics
• Space-efficient SLP encoding for O( N)-time random access

This page was built for publication: Practical Random Access to SLP-Compressed Texts

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