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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 483; s. 115 - 133
Hlavní autoři: Kreft, Sebastian, Navarro, Gonzalo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 29.04.2013
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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