Suffix tree based data compression
From MaRDI portal
Recommendations
- Truncated suffix trees and their application to data compression.
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- Burrows-Wheeler compression: Principles and reflections
- Compression algorithm of text files based on LZSS
- Compressed suffix trees with full functionality
Cited in
(4)
This page was built for publication: Suffix tree based data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711551)