资 源 简 介
This project provides a practical compressor based on LCA-online,
which can achieve fast and powerful compression for highly-repetitive string, for example, huge versioned documents collection, biological data collection of same or related species, and so on.
The working space of the program depends on the size of the compressed string, not the size of the string to be compressed; namely, the required space is very small if the input string is extremely compressible.
The LCA-online is a grammar-transform algorithm that translates an input string into a restricted context-free grammar (CFG) deriving the string uniquely.
The basic technique of compression is to hierarchically decompose a string to short blocks which are almost synchronized in common substrings,
and allocate a non-terminal symbol to each block from left to right.
The produced CFG can be further transformed into more compact representation by our encoder (see our paper for details).
Related Pu
