On Undetected Redundancy in the Burrows-Wheeler Transform

DOI10.4230/LIPIcs.CPM.2018.3zbMath1497.68168arXiv1804.01937OpenAlexW2964205235MaRDI QIDQ5140764

Uwe Baier

Publication date: 16 December 2020

Full work available at URL: https://arxiv.org/abs/1804.01937

zbMATH Keywords

tunnelinglossless data compressionBWT

Mathematics Subject Classification ID

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

Related Items (3)

Edge minimization in de Bruijn graphs ⋮ Indexing the bijective BWT ⋮ tbwt

Uses Software

• GitHub
• SDSL
• XZ Utils
• gzip
• zpaq
• 7-Zip
• bzip2
• bcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Data compression by means of a ``book stack
• Burrows-Wheeler compression: Principles and reflections
• Word-based text compression using the Burrows-Wheeler transform
• When indexing equals compression
• Suffix Arrays: A New Method for On-Line String Searches
• Indexing compressed text
• A universal algorithm for sequential data compression
• Arithmetic Coding
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: On Undetected Redundancy in the Burrows-Wheeler Transform