Space efficient algorithms for the Burrows-Wheeler backtransformation
DOI10.1007/S00453-008-9269-9zbMATH Open1203.94085OpenAlexW2143706415MaRDI QIDQ5961973FDOQ5961973
Authors: 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
Recommendations
Data structures (68P05) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Title not available (Why is that?)
- Compressed representations of sequences and full-text indexes
- An analysis of the Burrows-Wheeler transform
- Suffix Arrays: A New Method for On-Line String Searches
- Title not available (Why is that?)
- An experimental study of an opportunistic index
- Engineering a lightweight suffix array construction algorithm
- Fast lightweight suffix array construction and checking
- Faster suffix sorting
- Universal data compression based on the Burrows-Wheeler transformation: theory and practice
- Combinatorial Pattern Matching
- Compression boosting in optimal linear time using the Burrows-Wheeler transform
Cited In (4)
Uses Software
This page was built for publication: Space efficient algorithms for the Burrows-Wheeler backtransformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961973)
