A bisection algorithm for grammar-based compression of ordered trees
DOI10.1016/J.IPL.2010.07.004zbMATH Open1234.68099OpenAlexW2019758562MaRDI QIDQ407558FDOQ407558
Authors: Tatsuya Akutsu 
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/139421
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- A relation between edit distance for ordered trees and edit distance for Euler strings
- On an algorithm of Zemlyachenko for subtree isomorphism
- The Smallest Grammar Problem
- Grammar-based codes: a new class of universal lossless source codes
- An effective grammar-based compression algorithm for tree structured data.
Cited In (7)
- Grammar-Based Tree Compression
- Constructing small tree grammars and small circuits for formulas
- An effective grammar-based compression algorithm for tree structured data.
- Title not available (Why is that?)
- On the complexity of the smallest grammar problem over fixed alphabets
- Approximation of smallest linear tree grammar
- Tree compression using string grammars
This page was built for publication: A bisection algorithm for grammar-based compression of ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407558)
