Relative Lempel-Ziv Compression of Suffix Arrays

DOI10.1007/978-3-030-59212-7_7MaRDI QIDQ6485924zbMATH OpenFDO

Authors Simon J. Puglisi, Bella Zhukova

Publication date 22 December 2022

Published in 1511.68117 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Locally compressed suffix arrays
• scientific article; zbMATH DE number 6469201
• When indexing equals compression, experiments with compressing suffix arrays and applications
• New text indexing functionalities of the compressed suffix arrays
• scientific article; zbMATH DE number 1615289

Cited in

(10)

• RLZAP: relative Lempel-Ziv with adaptive pointers
• Lempel-Ziv-like parsing in small space
• Improved characters distance sampling for online and offline text searching
• Locally compressed suffix arrays
• A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
• Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
• Interval-based approach to lexicographic representation and compression of numeric data
• Lempel-Ziv Compression in a Sliding Window
• Relative Lempel-Ziv with constant-time random access
• Matching statistics -- a survey

This page was built for publication: Relative Lempel-Ziv Compression of Suffix Arrays

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