Dynamic entropy-compressed sequences and full-text indexes
From MaRDI portal
Publication:4962737
DOI10.1145/1367064.1367072zbMath1446.68043OpenAlexW2027244654MaRDI QIDQ4962737
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1367064.1367072
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (17)
Fast construction of wavelet trees ⋮ Grammar compressed sequences with rank/select support ⋮ Approximate string matching with compressed indexes ⋮ Compressed property suffix trees ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Space-efficient data-analysis queries on grids ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ Efficient fully-compressed sequence representations ⋮ Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. ⋮ Faster Practical Block Compression for Rank/Select Dictionaries ⋮ Dynamic extended suffix arrays ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Unnamed Item ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ A four-stage algorithm for updating a Burrows-Wheeler transform ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Rank/select on dynamic compressed sequences and applications
This page was built for publication: Dynamic entropy-compressed sequences and full-text indexes
