Space efficient algorithms for the Burrows-Wheeler backtransformation

DOI10.1007/S00453-008-9269-9zbMath1203.94085OpenAlexW2143706415MaRDI QIDQ5961973

Ulrich Lauther, Tamás Lukovszki

Publication date: 16 September 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.3603

zbMATH Keywords

data compressionBurrows-Wheeler transformation

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Source coding (94A29)

Uses Software

• Canterbury

Cites Work

• Engineering a lightweight suffix array construction algorithm
• Faster suffix sorting
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• An analysis of the Burrows—Wheeler transform
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• Fast Lightweight Suffix Array Construction and Checking
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Space efficient algorithms for the Burrows-Wheeler backtransformation