Data compression with finite windows
Communications of the ACM
ACM Computing Surveys (CSUR)
ACM Transactions on Information Systems (TOIS)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Dictionary selection using partial matching
Information Sciences: an International Journal
On-Line Construction of Compact Directed Acyclic Word Graphs
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
LZP: A New Data Compression Algorithm
DCC '96 Proceedings of the Conference on Data Compression
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 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
Piecewise Integer Mapping for Arithmetic Coding
DCC '98 Proceedings of the Conference on Data Compression
DCC '02 Proceedings of the Data Compression Conference
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms - SPIRE 2002
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
Compressed directed acyclic word graph with application in local alignment
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
Suffix tree is a widely studied data structure with a range of applications. Although originally developed for string matching algorithms, it has proved to be useful for implementation of various lossless data compression methods. This interesting fact inspired us to explore the possibilities of creating new data compression methods, based entirely on properties of suffix trees. Resulting from a thorough study of existing suffix tree construction algorithms and their modifications, we propose and evaluate several variants of suffix tree based compression.