A bisection algorithm for grammar-based compression of ordered trees

Authors:
Tatsuya Akutsu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto 611-0011, Japan
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 2

On an algorithm of Zemlyachenko for subtree isomorphism

Information Processing Letters
Application of Lempel--Ziv factorization to the approximation of grammar-based compression

Theoretical Computer Science
A relation between edit distance for ordered trees and edit distance for Euler strings

Information Processing Letters
Efficient memory representation of XML document trees

Information Systems
Grammar-based codes: a new class of universal lossless source codes

IEEE Transactions on Information Theory
The smallest grammar problem

IEEE Transactions on Information Theory

XML tree structure compression using RePair

Information Systems
A quadsection algorithm for grammar-based image compression

Integrated Computer-Aided Engineering - Anniversary Volume: Celebrating 20 Years of Excellence

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider grammar-based compression for rooted ordered trees. For that purpose, we define an elementary ordered tree grammar (EOTG) by extending CFG, and then present a polynomial time algorithm which approximates the smallest EOTG within a factor of O(n^5^/^6). We also show that the grammar and algorithm can be modified for unordered trees of bounded degree.