LZ77 factorisation of trees

DOI10.4230/LIPICS.FSTTCS.2016.35MaRDI QIDQ4636583zbMATH OpenFDO

Authors Paweł Gawrychowski, Artur Jeż

Publication date 19 April 2018

zbMATH Keywords

tree compressiontree grammarsSLPgrammar compressionLZ77

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

• Efficient LZ78 factorization of grammar compressed text
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lempel-Ziv factorization: simple, fast, practical
• Lazy Lempel-Ziv factorization algorithms

Cited in

(4)

• A separation between RLSLPs and LZ77
• Slowing down top trees for better worst-case compression
• Sensitivity of string compressors and repetitiveness measures
• Slowing down top trees for better worst-case compression

This page was built for publication: LZ77 factorisation of trees

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