Block trees
From MaRDI portal
Publication:2221797
DOI10.1016/j.jcss.2020.11.002zbMath1477.68076OpenAlexW4214904110MaRDI QIDQ2221797
Juha Kärkkäinen, Manuel O. Cáceres, Gonzalo Navarro, Simon J. Puglisi, Travis Gagie, Alberto Ordóñez, Yasuo Tabei, Paweł Gawrychowski, Djamal Belazzougui
Publication date: 2 February 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2020.11.002
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 (2)
Grammar-compressed indexes with logarithmic search time ⋮ Sensitivity of string compressors and repetitiveness measures
Cites Work
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- A simple storage scheme for strings achieving entropy bounds
- A \textit{really} simple approximation of smallest grammar
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Universal compressed text indexing
- Collage system: A unifying framework for compressed pattern matching.
- Towards a definitive measure of repetitiveness
- Approximate pattern matching in LZ77-compressed texts
- Grammar compressed sequences with rank/select support
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Time-space trade-offs for predecessor search
- Faster Approximate Pattern Matching in Compressed Repetitive Texts
- Succinct indexes for strings, binary relations and multilabeled trees
- Access, Rank, and Select in Grammar-compressed Strings
- The Smallest Grammar Problem
- Squeezing succinct data structures into entropy bounds
- Efficient randomized pattern-matching algorithms
- Linear Algorithm for Data Compression via String Matching
- Data compression via textual substitution
- Efficient string matching
- On the Complexity of Finite Sequences
- Jewels of Stringology
- Grammar-based codes: a new class of universal lossless source codes
- Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- Optimal Lower and Upper Bounds for Representing Sequences
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Optimal rank and select queries on dictionary-compressed text
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- A Self-index on Block Trees
- Complete inverted files for efficient text retrieval and analysis
- At the roots of dictionary compression: string attractors
- Optimal Construction of Compressed Indexes for Highly Repetitive Texts
- Random Access to Grammar-Compressed Strings and Trees
- Faster Compressed Suffix Trees for Repetitive Collections
This page was built for publication: Block trees
