Hledání optimální abecedy pro kompresi textových dat

Abstract

Main goal of this work is to design and to implement optimal alphabet searching algorithm for text data compression. Is desirable to find alphabet contains only necessary symbols effectively increasing compression ratio. Author deals with the combination of three different approaches to text files. For this optimization problem is choosen selforganizing migration algorithm from evolutionary group. Compression is implement by LZW method, version with tree structured dictionary representation. Results evaluation is based on different types of text files testing. Whole work is created in programming language C#.