An effective grammar-based compression algorithm for tree structured data.

DOI10.1007/B13700MaRDI QIDQ5897189zbMATH OpenOpenAlexFDO

Authors Kazunori Yamagata, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13700

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Recommendations

• A bisection algorithm for grammar-based compression of ordered trees
• Approximation of smallest linear tree grammar

Cited in

(4)

• Compression of unordered XML trees
• Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
• Algorithmic height compression of unordered trees
• A bisection algorithm for grammar-based compression of ordered trees

This page was built for publication: An effective grammar-based compression algorithm for tree structured data.

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