A grammar transform is a transformation that converts any data sequence to be compressed
into a grammar from which the original data sequence can be fully reconstructed. In a …

As the data or information gets increased in various applications, it is very much essential to
make the retrieval and modeling easier and simple. Number of modeling aspects already …

The present invention relates to the compression of color image data. A combination of hard
decision pixel map** and Soft decision pixel map** is used to jointly address both …

Motivated by the goal of discovering hierarchical structures inside DNA sequences, we
address the Smallest Grammar Problem, the problem of finding a smallest context-free …

A framework of context-sensitive grammar transform is proposed. A greedy compression
algorithm with the transform model is presented as well as a Knuth-Morris-Pratt (KMP)-type …

A data string can be represented with the help of context-free grammar such that the string is
the unique string belonging to the language of the grammar. One can then losslessly …

The present invention relates to the compression of color image data. A combination of hard
decision pixel map** and soft decision pixel map** is used to jointly address both …

In this paper, we investigate the performance of grammar-based codes for sources with
countably infinite alphabets. Let/spl Lambda/denote an arbitrary class of stationary, ergodic …

GLZA is a free, open-source, enhanced grammar-based compressor that constructs a low
entropy grammar amenable to entropy coding, using a greedy hill-climbing search guided …

We survey our recent work related to information processing on compressed strings. Note
that a “string” here contains any fixed-length sequence of symbols and therefore includes …