Scholarlink

A wavelet forest for a text T[1..n] over an alphabet \(\sigma \) takes \(n H_0 (T) + o (n \log \sigma )\) bits of space and supports access and rank on T in \(O (\log \sigma )\) time. Kärkkäinen and Puglisi (2011) implicitly introduced wavelet forests and showed that when T is the Burrows-Wheeler Transform (BWT) of a string S, then a wavelet forest for T occupies space bounded in terms of higher-order empirical entropies of S even when the forest is implemented with uncompressed bitvectors. In this paper we show experimentally that wavelet forests also have better access locality than wavelet trees and are thus interesting even when higher-order compression is not effective on S, or when T is not a BWT at all.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Another Virtue of Wavelet Forests

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Aaron Hong,
  • Christina Boucher,
  • Travis Gagie,
  • Yansong Li,
  • Norbert Zeh

摘要

A wavelet forest for a text T[1..n] over an alphabet \(\sigma \) takes \(n H_0 (T) + o (n \log \sigma )\) bits of space and supports access and rank on T in \(O (\log \sigma )\) time. Kärkkäinen and Puglisi (2011) implicitly introduced wavelet forests and showed that when T is the Burrows-Wheeler Transform (BWT) of a string S, then a wavelet forest for T occupies space bounded in terms of higher-order empirical entropies of S even when the forest is implemented with uncompressed bitvectors. In this paper we show experimentally that wavelet forests also have better access locality than wavelet trees and are thus interesting even when higher-order compression is not effective on S, or when T is not a BWT at all.