| Versions tested: | 0.02 |
| Optimal parameters: | default |
| Links: | http://nanozip.net/b... |
| Authors: | Sami Runsas |
| Algorithms: | BWT+CM |
| Notable peformances: | - |
The program...
...implements a "compressed model" in which the data is kept compressed in memory all the time.the program documentationCompressed model program flow:
Compression: compression -> bwt -> compression
Decompression: decompression -> compression -> unbwt -> decompressionBWMonstr is able to perform BWT compression and decompression using about 0.5n space for English text. This is 10% of the amount that typical BWT implementations use and around 3% - 5% that of PPM or CM implementations.
The program supports multi-threading. In practice the speedup for compression translates in the following way:
2 processors: 1.57x
3 processors: 1.83x
4 processors: 2.25x
The compressor is featured in the BWT comparison.
(Have info that should be added here? E-mail.)
| Ver | Rating | CPR | DPR | S.E. | R.E. | Ratio | C. kB/s | D. kB/s | ||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| <none> | ||||||||||||
| 0.02 | 4 | 4 | 6 | 2 | 1 | 3.351 | 12 | 15 | ||||