Computing the inverse sort transform in linear time

DOI10.1145/1921659.1921673zbMath1295.68105OpenAlexW1994046086MaRDI QIDQ3189009

Sen Zhang, Ge Nong, Wai Hong Chan

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1921659.1921673

zbMATH Keywords

inverse transformBurrows-Wheeler transformlinear timelimited order context

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: Computing the inverse sort transform in linear time