Advantages of Shared Data Structures for Sequences of Balanced Parentheses

Authors:
Simon Gog;Johannes Fischer
Affiliations:
-;-
Venue:
DCC '10 Proceedings of the 2010 Data Compression Conference
Year:
2010

Citing 0
Cited 4

CST++

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Lempel-Ziv factorization revisited

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Self-indexing based on LZ77

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On compressing and indexing repetitive sequences

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.