Suffixové stromy

Abstract

Suffix tree is very interesting data structure regarding working with strings and enables effective execution of many operations with them, e.g. searching. Aim of this thesis is to use this feature in compression algorithm which is devised and implemented. We analyse behavior of suffix tree during construction and also during suffix links simulation and, because necessary part of compression is keeping of string in sliding window, also during sliding of the window. A way, how to store movement of active point through tree to be able to reconstruct original string at decompression, is devised and implemented. At the end we find out from experiments, what is the difference between results of compression on characters level and on word level.