Wavelet Trees for All

DOI10.1007/978-3-642-31265-6_2zbMath1358.68081OpenAlexW2163005732MaRDI QIDQ2904475

Gonzalo Navarro

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_2

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (11)

Parallel construction of succinct trees ⋮ An Opportunistic Text Indexing Structure Based on Run Length Encoding ⋮ Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation ⋮ Priority Queues and Sorting for Read-Only Data ⋮ Spaces, Trees, and Colors ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Selection from read-only memory with limited workspace ⋮ General Document Retrieval in Compact Space ⋮ Improved parallel construction of wavelet trees and rank/select structures ⋮ Orthogonal Range Searching for Text Indexing ⋮ Array Range Queries

This page was built for publication: Wavelet Trees for All