Universal data compression based on the Burrows-Wheeler transformation: theory and practice

DOI10.1109/12.888040zbMath1314.94038OpenAlexW2141473546MaRDI QIDQ3417040

Stefan Kurtz, Bernhard Balkenhol

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/84dc56a4810852db5b9241865a2c4657cbe1140d

zbMATH Keywords

suffix trees

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items (8)

Compressed parameterized pattern matching ⋮ Unnamed Item ⋮ Burrows-Wheeler compression: Principles and reflections ⋮ Compressing table data with column dependency ⋮ Investigation of block-sorting of multiset permutations ⋮ Second step algorithms in the Burrows-Wheeler compression algorithm ⋮ Space efficient algorithms for the Burrows-Wheeler backtransformation ⋮ Context exhumation after the Burrows-Wheeler transform

This page was built for publication: Universal data compression based on the Burrows-Wheeler transformation: theory and practice