Top tree compression of tries
From MaRDI portal
Publication:2067669
Recommendations
- Top Tree Compression of Tries.
- Fast compressed tries through path decompositions
- Fast Compressed Tries through Path Decompositions
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
Cites work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A faster grammar-based self-index
- Biased Search Trees
- Composite repetition-aware data structures
- Compressed indexing with signature grammars
- Compressed representations of sequences and full-text indexes
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Convex hulls of finite sets of points in two and three dimensions
- Data structures for path queries
- Deterministic indexing for packed strings
- Dynamic index and LZ factorization in compressed space
- Efficient randomized pattern-matching algorithms
- Fast compressed tries through path decompositions
- Fast Pattern Matching in Strings
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- scientific article; zbMATH DE number 1670815 (Why is no real title available?)
- scientific article; zbMATH DE number 177536 (Why is no real title available?)
- scientific article; zbMATH DE number 1998345 (Why is no real title available?)
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 2230164 (Why is no real title available?)
- Lempel-Ziv-78 compressed string dictionaries
- Linear-size CDAWG: new repetition-aware indexing and grammar compression
- Lower bounds for orthogonal range searching: I. The reporting case
- LZ77-based self-indexing with faster pattern matching
- Maintaining information in fully dynamic trees with top trees
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Practical implementation of space-efficient dynamic keyword dictionaries
- Random access to grammar-compressed strings and trees
- Representing trees of higher degree
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
- Self-indexed grammar-based compression
- Simplex range reporting on a pointer machine
- Slowing down top trees for better worst-case compression
- Storage and Retrieval of Individual Genomes
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- The level ancestor problem simplified
- Tight bounds for top tree compression
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Top Tree Compression of Tries.
- Tree compression with top trees
- Universal compressed text indexing
- Variations on the Common Subexpression Problem
Cited in
(8)- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Fast compressed tries through path decompositions
- Alphabet-dependent string searching with wexponential search trees
- scientific article; zbMATH DE number 4775 (Why is no real title available?)
- Compressed cache-oblivious string B-tree
- Fast Compressed Tries through Path Decompositions
- Top Tree Compression of Tries.
- Trickier XBWT tricks
This page was built for publication: Top tree compression of tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067669)
