On compressing and indexing repetitive sequences

We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary text substrings. We then build the first self-index based on LZ77 (or LZ-End) compression, which in addition to text ext...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 483; pp. 115 - 133
Main Authors: Kreft, Sebastian, Navarro, Gonzalo
Format: Journal Article
Language:English
Published: Elsevier B.V 29.04.2013
Subjects:
Compression
Lempel–Ziv
Repetitive texts
Self-indexing
Succinct data structures
Repetitive texts
Compression
Succinct data structures
Self-indexing
Lempel–Ziv
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary text substrings. We then build the first self-index based on LZ77 (or LZ-End) compression, which in addition to text extraction offers fast indexed searches on the compressed text. This self-index is particularly effective for representing highly repetitive sequence collections, which arise for example when storing versioned documents, software repositories, periodic publications, and biological sequence databases.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.02.006