A bisection algorithm for grammar-based compression of ordered trees
From MaRDI portal
Publication:407558
DOI10.1016/j.ipl.2010.07.004zbMath1234.68099OpenAlexW2019758562MaRDI QIDQ407558
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
Grammar-Based Tree Compression ⋮ Approximation of smallest linear tree grammar ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Tree compression using string grammars ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Unnamed Item
Cites Work
- On an algorithm of Zemlyachenko for subtree isomorphism
- A relation between edit distance for ordered trees and edit distance for Euler strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- The Smallest Grammar Problem
- Grammar-based codes: a new class of universal lossless source codes
- Inductive Logic Programming
This page was built for publication: A bisection algorithm for grammar-based compression of ordered trees
