Grammar compressed sequences with rank/select support

@article{Pereira2017GrammarCS,
  title={Grammar compressed sequences with rank/select support},
  author={Alberto Ord{\'o}{\~n}ez Pereira and Gonzalo Navarro and Nieves R. Brisaboa},
  journal={ArXiv},
  year={2017},
  volume={abs/1911.09077}
}
  • Alberto Ordóñez Pereira, Gonzalo Navarro, Nieves R. Brisaboa
  • Published in J. Discrete Algorithms 2017
  • Computer Science
  • 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. Several recent applications need to represent highly repetitive sequences, and classical statistical compression proves ineffective. We introduce, instead, grammar-based representations for repetitive sequences, which use up to 6% of the space needed by statistically compressed representations, and support… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    Document retrieval on repetitive string collections

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND

    Grammar compressed sequences with rank/select support

    VIEW 2 EXCERPTS
    CITES METHODS

    Document Counting in Compressed Space

    VIEW 1 EXCERPT

    Finger Search in Grammar-Compressed Strings

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 56 REFERENCES

    Fast in-memory XPath search using compressed indexes

    VIEW 9 EXCERPTS

    Off-line dictionary-based compression

    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    A method for the construction of minimum-redundancy codes

    • D. A. Huffman
    • Proceedings of the I.R.E., 40(9):1098–1101,
    • 1952
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Rank/select operations on large alphabets: a tool for text indexing

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    A Block-sorting Lossless Data Compression Algorithm

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    A universal algorithm for sequential data compression

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL