Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

LZ77 factorisation of trees

From MaRDI portal
Publication:4636583
Jump to:navigation, search

DOI10.4230/LIPICS.FSTTCS.2016.35zbMATH Open1391.68032MaRDI QIDQ4636583FDOQ4636583


Authors: Paweł Gawrychowski, Artur Jeż Edit this on Wikidata


Publication date: 19 April 2018





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


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)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4636583&oldid=18819315"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 15:30. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki