The wavelet matrix: An efficient wavelet tree for large alphabets
作者：
Highlights：
• We improve current wavelet tree representations on large alphabets.
• We reduce the number of operations needed to solve access, rank and select queries.
• We introduce Huffman compression on the sequence to further reduce space and time.
• We show that the resulting structures are the most efficient to represent sequences on large alphabets in most aspects.
摘要
Highlights•We improve current wavelet tree representations on large alphabets.•We reduce the number of operations needed to solve access, rank and select queries.•We introduce Huffman compression on the sequence to further reduce space and time.•We show that the resulting structures are the most efficient to represent sequences on large alphabets in most aspects.
论文关键词：Succinct data structures,Compressed sequence representations
论文评审过程：Received 17 October 2013, Revised 28 May 2014, Accepted 12 June 2014, Available online 25 June 2014.
论文官网地址：https://doi.org/10.1016/j.is.2014.06.002
