Truncated suffix trees and their application to data compression

Authors:
Joong Chae Na;Alberto Apostolico;Costas S. Iliopoulos;Kunsoo Park
Affiliations:
School of Computer Science & Engineering, Seoul National University, South Korea;Dipartimento di Elettronica e Informatica, Università di Padova, Italy and Department of Computer Sciences, Purdue University;Department of Computer Science, King's College London, UK and School of Computing, Curtin University of Technology, Australia;School of Computer Science & Engineering, Seoul National University, South Korea
Venue:
Theoretical Computer Science
Year:
2003

Citing 12
Cited 6

Data compression with finite windows

Communications of the ACM
Text algorithms

Text algorithms
Data compression for PC software distribution

Software—Practice & Experience
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
Data compression via textual substitution

Journal of the ACM (JACM)
PRAM Algorithms for Static Dictionary Compression

Proceedings of the 8th International Symposium on Parallel Processing
Extended application of suffix trees to data compression

DCC '96 Proceedings of the Conference on Data Compression
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
The Context Trees of Block Sorting Compression

DCC '98 Proceedings of the Conference on Data Compression

An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences

International Journal of Bioinformatics Research and Applications
Approximate variable-length time series motif discovery using grammar inference

Proceedings of the Tenth International Workshop on Multimedia Data Mining
Sparse and truncated suffix trees on variable-length codes

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On-Line linear-time construction of word suffix trees

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Space-conscious compression

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The suffix tree is a fundamental data structure in the area of string algorithms and it has been used in many applications including data compression. In this paper we propose a data structure called the truncated suffix tree, which is a truncated version of the suffix tree. We also present two linear-time construction algorithms for truncated suffix trees and two algorithms that delete suffixes from truncated suffix trees.The truncated suffix tree is particularly a useful data structure for LZ77 that compresses using a sliding window of a fixed size. Our algorithms lead to two implementations of LZ77 that maintain sliding windows by truncated suffix trees. We also present a technique of finding the longest match in a sliding window, which is a crucial step in LZ77.