Data compression with factor automata
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Arithmetic coding for data compression
Communications of the ACM
Robust universal complete codes for transmission and compression
Discrete Applied Mathematics
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
DCC '99 Proceedings of the Conference on Data Compression
An improved algorithm for finding longest repeats with a modified factor oracle
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Substring search and repeat search using factor oracles
Information Processing Letters
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms
Statistical Properties of Factor Oracles
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Substring search and repeat search using factor oracles
Information Processing Letters
Statistical properties of factor oracles
Journal of Discrete Algorithms
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Hi-index | 0.89 |
We present in this article a linear time and space data compression method. This method, based on a factor oracle and the computation of the length of repeated suffixes, is easy to implement, fast and gives good compression ratios.