Add to ORKGAbstract. This paper gives a survey on recent progress in grammar-based compression for trees. Also algorithms that directly work on gram-mar-compressed trees will be surveyed.
We apply so-called tree straight-line programs to the problem of universal source coding for binary ...
A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induc...
Grammar-based compression approach to extraction of common rules among multiple trees of glycans and...
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeR...
In this paper, we consider grammar-based compression for rooted ordered trees. For that purpose, we ...
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(r^2 g ł...
We introduce a new linear time compression algorithm, called 'Repair for Trees', which compresses or...
AbstractTrees can be conveniently compressed with linear straight-line context-free tree grammars. S...
Different methods for compressing trees are surveyed and developed. Tree compression can be seen as ...
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(r^2.g.l...
Trees are a ubiquitous data structure in computer science. LISP, for instance, was designed to manip...
Several recently-proposed data compression algorithms are based on the idea of representing a string...
We introduce forest straight-line programs (FSLPs) as a compressed representation of unranked ordere...
This week’s paper [1] discusses a method of lossless data compression called grammar-based codes. Th...
Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deri...
We apply so-called tree straight-line programs to the problem of universal source coding for binary ...
A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induc...
Grammar-based compression approach to extraction of common rules among multiple trees of glycans and...
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeR...
In this paper, we consider grammar-based compression for rooted ordered trees. For that purpose, we ...
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(r^2 g ł...
We introduce a new linear time compression algorithm, called 'Repair for Trees', which compresses or...
AbstractTrees can be conveniently compressed with linear straight-line context-free tree grammars. S...
Different methods for compressing trees are surveyed and developed. Tree compression can be seen as ...
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(r^2.g.l...
Trees are a ubiquitous data structure in computer science. LISP, for instance, was designed to manip...
Several recently-proposed data compression algorithms are based on the idea of representing a string...
We introduce forest straight-line programs (FSLPs) as a compressed representation of unranked ordere...
This week’s paper [1] discusses a method of lossless data compression called grammar-based codes. Th...
Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deri...
We apply so-called tree straight-line programs to the problem of universal source coding for binary ...
A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induc...
Grammar-based compression approach to extraction of common rules among multiple trees of glycans and...