Data compression with truncated suffix trees

Summary form only given. The suffix tree is an efficient data structure used for Ziv-Lempel coding schemes. We propose a new data structure called the k-truncated suffix tree (k-TST), which is a truncated version of the suffix tree. While the suffix tree maintains all substrings of a given string, the k-TST stores the substrings of length at most k, where k is a constant. Hence the truncated suffix tree needs less space than the suffix tree