Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform

DOI10.1007/978-3-319-15579-1_46zbMath1451.68102OpenAlexW326048701MaRDI QIDQ2799209

Nicola Prezza, Alberto Policriti, Nicola Gigante

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_46

Mathematics Subject Classification ID

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

Related Items (3)

Space-efficient construction of compressed suffix trees ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ LZ77 computation based on the run-length encoded BWT

This page was built for publication: Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform