7 citations · 8 across the 3 of their papers we have counts for
3 papers
Grammar Compressed Sequences with Rank/Select Support
Alberto Ordóñez, Gonzalo Navarro, Nieves R. Brisaboa
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. S…
Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes
Antonio Fariña, Travis Gagie, Szymon Grabowski +3
For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, howeve…
Efficient Compressed Wavelet Trees over Large Alphabets
Francisco Claude, Gonzalo Navarro, Alberto Ordóñez
The {\em wavelet tree} is a flexible data structure that permits representing sequences of symbols over an alphabet of size , within compressed space and supporting a w…