Text compression
New indices for text: PAT Trees and PAT arrays
Information retrieval
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Data compression: the complete reference
Data compression: the complete reference
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Context Tables: A Tool for Describing Text Compression Algorithms
DCC '98 Proceedings of the Conference on Data Compression
IEEE Transactions on Information Theory
On the role of pattern matching in information theory
IEEE Transactions on Information Theory
PPM*-Style Context Sorting Compression Method Using a Prefix List
DCC '00 Proceedings of the Conference on Data Compression
| Hi-index | 0.02 |
This paper proposes a simple data structure, called a prefix list, which maintains all prefixes of a string in reverse lexicographic order. It can be on-line incrementally constructed in time and space linear in the string length. It is strongly related to suffix trees and suffix arrays, and may share applications with these existing structures. A suffix array can be built via the corresponding prefix list in linear time. Particular applications of the prefix list lie in source-coding problems that require on-line right-to-left string matching. We apply the prefix list to on-line estimation of source entropy and to context-based symbol-ranking text compression algorithms.