Lempel-Ziv-78 compressed string dictionaries
From MaRDI portal
Publication:724216
DOI10.1007/s00453-017-0348-7zbMath1392.68183OpenAlexW2738952118MaRDI QIDQ724216
Publication date: 25 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0348-7
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items
c-trie++: a dynamic trie tailored for fast prefix searches, Dynamic Path-decomposed Tries, Engineering Practical Lempel-Ziv Tries, Compressed string dictionaries via data-aware subtrie compaction, Top tree compression of tries, Compressed automata for dictionary matching
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Stronger Lempel-Ziv based compressed text indexing
- Fast Compressed Tries through Path Decompositions
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Lempel Ziv Computation in Small Space (LZ-CISS)
- Compressed representations of sequences and full-text indexes
- The compressed permuterm index
- Fully compressed suffix trees
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Compression of individual sequences via variable-rate coding
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- Optimal Lower and Upper Bounds for Representing Sequences
- A Method for the Construction of Minimum-Redundancy Codes
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Algorithms and Data Structures
