Wavelet trees for all
From MaRDI portal
Publication:2904475
DOI10.1007/978-3-642-31265-6_2zbMATH Open1358.68081OpenAlexW2163005732MaRDI QIDQ2904475FDOQ2904475
Authors: 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
Recommendations
Cited In (16)
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
- New algorithms on wavelet trees and applications to information retrieval
- Array range queries
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Parallel construction of succinct trees
- The myriad virtues of wavelet trees
- Orthogonal range searching for text indexing
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Fully functional static and dynamic succinct trees
- On wavelet tree construction
- Improved parallel construction of wavelet trees and rank/select structures
- General document retrieval in compact space
- Priority queues and sorting for read-only data
- Wavelet trees for all
- The Myriad Virtues of Wavelet Trees
- Selection from read-only memory with limited workspace
This page was built for publication: Wavelet trees for all
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904475)