Data Compression Conference (2010)
Mar. 24, 2010 to Mar. 26, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2010.43
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is that it shares most of its internal data structures for all operations. This is reflected in a large reduction of space, and also in faster navigation times. We exhibit these advantages on two examples: succinct range minimum queries and compressed suffix trees. Our data structures are incorporated into a ready-to-use C++-library for succinct data structures.
Succinct Data Structures, Range Minimum Query
Simon Gog, Johannes Fischer, "Advantages of Shared Data Structures for Sequences of Balanced Parentheses", Data Compression Conference, vol. 00, no. , pp. 406-415, 2010, doi:10.1109/DCC.2010.43