Self-indexed Text Compression Using Straight-Line Programs
From MaRDI portal
Publication:3182928
DOI10.1007/978-3-642-03816-7_21zbMath1233.68132OpenAlexW1570532020MaRDI QIDQ3182928
Francisco Claude, Gonzalo Navarro
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_21
Related Items (6)
On compressing and indexing repetitive sequences ⋮ New algorithms on wavelet trees and applications to information retrieval ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Practical compressed suffix trees ⋮ Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts ⋮ Random Access to Grammar-Compressed Strings and Trees
Uses Software
Cites Work
- The level ancestor problem simplified
- Representing trees of higher degree
- Indexing text using the Ziv--Lempel trie
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Collage system: A unifying framework for compressed pattern matching.
- Rank and select revisited and extended
- Compressed representations of sequences and full-text indexes
- Indexing compressed text
- The Smallest Grammar Problem
- Rank/select operations on large alphabets
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Grammar-based codes: a new class of universal lossless source codes
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- On the sorting-complexity of suffix tree construction
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Self-indexed Text Compression Using Straight-Line Programs
