Grammar Compressed Sequences with Rank/Select Support

  • Gonzalo Navarro
  • Alberto Ordóñez
Conference paper

DOI: 10.1007/978-3-319-11918-2_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8799)
Cite this paper as:
Navarro G., Ordóñez A. (2014) Grammar Compressed Sequences with Rank/Select Support. In: Moura E., Crochemore M. (eds) String Processing and Information Retrieval. SPIRE 2014. Lecture Notes in Computer Science, vol 8799. Springer, Cham

Abstract

Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. In several recent applications, the need to represent highly repetitive sequences arises, where statistical compression is ineffective. We introduce grammar-based representations for repetitive sequences, which use up to 10% of the space needed by representations based on statistical compression, and support direct access and rank/select operations within tens of microseconds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Gonzalo Navarro
    • 1
  • Alberto Ordóñez
    • 2
  1. 1.Dept. of Computer ScienceUniv. of ChileChile
  2. 2.Lab. de Bases de DatosUniv. da CoruñaSpain

Personalised recommendations