论文信息 - Queries on LZ-Bounded Encodings

Queries on LZ-Bounded Encodings

We describe a data structure that stores a strings in space similar to that of its Lempel-Ziv encoding and efficiently supports access, rank and select queries. These queries are fundamental for implementing succinct and compressed data structures, such as compressed trees and graphs. We show that our data structure can be built in a scalable manner and is both small and fast in practice compared to other data structures supporting such queries.

[1] Gonzalo Navarro,et al. Faster Compressed Suffix Trees for Repetitive Text Collections , 2014, SEA.

[2] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.

[3] Gonzalo Navarro,et al. Practical Compressed Document Retrieval , 2011, SEA.

[4] Simon J. Puglisi,et al. Faster Approximate Pattern Matching in Compressed Repetitive Texts , 2011, ISAAC.

[5] Simon J. Puglisi,et al. Block Graphs in Practice , 2014, ICABD.

[6] Yasuo Tabei,et al. Rank, select and access in grammar-compressed strings , 2014, ArXiv.

[7] Sebastian Maneth,et al. XML tree structure compression using RePair , 2013, Inf. Syst..

[8] Gonzalo Navarro,et al. Grammar compressed sequences with rank/select support , 2014, J. Discrete Algorithms.

[9] Naila Rahman,et al. Rank and Select Operations on Binary Strings , 2016, Encyclopedia of Algorithms.

[10] Travis Gagie. Rank and Select Operations on Sequences , 2016, Encyclopedia of Algorithms.

[11] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[12] Ayumi Shinohara,et al. Collage system: a unifying framework for compressed pattern matching , 2003, Theor. Comput. Sci..

[13] John L. Smith. Tables , 1969, Neuromuscular Disorders.