Learn More
There are two basic types of text compression by symbols – in the first case symbols are represented by characters, in the second case by whole words. The first case is useful for very short files, the second case for very long files or large collections. We supposed that there exist yet another way where symbols are represented by units shorter than words(More)
Stefan Verheye, MD, PHD,* Pierfrancesco Agostoni, MD,* Christophe L. Dubois, MD,† Joseph Dens, MD, PHD,‡ John Ormiston, MD,§ Stephen Worthley, MD, Brett Trauthen, MS,¶ Takao Hasegawa, MD,# Bon-Kwon Koo, MD, PHD,# Peter J. Fitzgerald, MD, PHD,# Roxana Mehran, MD,** Alexandra J. Lansky, MD** Antwerp, Leuven, and Genk, Belgium; Auckland, New Zealand; Adelaide,(More)
Summary form only given. We adapted well-known algorithms of adaptive Huffman coding and LZW to use syllables and words instead of characters for text compression. We tested the algorithms on collections of small or middle-sized files. Using syllable-based compression algorithms on English documents gives expected results: they outperform character-based(More)
Some text compression methods take advantage from using more complex compression units than characters. The synchronization between coder and decoder then can be done by transferring the unit dictionary together with the compressed message. We propose to use a dictionary compression method based on a proper ordering of nodes of the tree-organized(More)
Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression ratio. Suffix arrays are used in the coding phase of BWT and we focus on creating them for an alphabet larger than 256 symbols. The motivation for this work has been software project XBW-an application for compression of large XML(More)
Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. This work is to compare the single file parsing methods used on input text files by means of Burrows-Wheeler(More)