Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices

DOI10.1145/1671970.1883684zbMath1284.68253OpenAlexW1980845733MaRDI QIDQ5406227

Diego Arroyuelo, Gonzalo Navarro

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1671970.1883684

zbMATH Keywords

compressed data structuresLempel-Ziv compressionindexed text search

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (2)

Stronger Lempel-Ziv based compressed text indexing ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes

This page was built for publication: Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices