When indexing equals compression
From MaRDI portal
Publication:2944533
DOI10.1145/1198513.1198521zbMath1430.68099OpenAlexW1969046465MaRDI QIDQ2944533
Roberto Grossi, Ankur Gupta, Luca Foschini, Jeffrey Scott Vitter
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1198513.1198521
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (10)
The myriad virtues of wavelet trees ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ Rank and select revisited and extended ⋮ Move-to-front, distance coding, and inversion frequencies revisited ⋮ Unnamed Item ⋮ Rank/select on dynamic compressed sequences and applications ⋮ Comparison between text compression algorithms in biological sequences ⋮ Improved parallel construction of wavelet trees and rank/select structures ⋮ On Undetected Redundancy in the Burrows-Wheeler Transform ⋮ Adaptive succinctness
This page was built for publication: When indexing equals compression
