Top tree compression of tries
From MaRDI portal
Publication:2067669
DOI10.1007/s00453-021-00869-wOpenAlexW2990872128MaRDI QIDQ2067669
Oren Weimann, Philip Bille, Gad M. Landau, Inge Li Gørtz, Paweł Gawrychowski
Publication date: 18 January 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02187
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The level ancestor problem simplified
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Lempel-Ziv-78 compressed string dictionaries
- Representing trees of higher degree
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Universal compressed text indexing
- Simplex range reporting on a pointer machine
- Compressed indexing with signature grammars
- Dynamic index and LZ factorization in compressed space
- Tree compression with top trees
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Fast Compressed Tries through Path Decompositions
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- A Faster Grammar-Based Self-index
- Composite Repetition-Aware Data Structures
- Maintaining information in fully dynamic trees with top trees
- Compressed representations of sequences and full-text indexes
- Self-Indexed Grammar-Based Compression
- Lower bounds for orthogonal range searching: I. The reporting case
- Storage and Retrieval of Individual Genomes
- Biased Search Trees
- Efficient randomized pattern-matching algorithms
- Variations on the Common Subexpression Problem
- Convex hulls of finite sets of points in two and three dimensions
- Fast Pattern Matching in Strings
- Data Structures for Path Queries
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Deterministic Indexing for Packed Strings
- Slowing Down Top Trees for Better Worst-Case Compression
- Tight Bounds for Top Tree Compression
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
- Random Access to Grammar-Compressed Strings and Trees
- LZ77-Based Self-indexing with Faster Pattern Matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Top Tree Compression of Tries.
