Top tree compression of tries
type: Item
instance of: scholarly article
title: Top tree compression of tries
author: Philip Bille
author: Inge Li Gørtz
author: Gad M. Landau
author: Oren Weimann
author: Paweł Gawrychowski
published in: Algorithmica
publication date: 2022-01-18T00:00:00Z
full work available at URL: https://arxiv.org/abs/1902.02187
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11500/
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7458813
zbMATH Keywords: pattern matching
zbMATH Keywords: tree compression
zbMATH Keywords: top trees
zbMATH Keywords: pointer machine
MaRDI profile type: Publication
OpenAlex ID: W2990872128
cites work: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
cites work: Q2754135
cites work: Maintaining information in fully dynamic trees with top trees
cites work: Lempel-Ziv-78 compressed string dictionaries
cites work: Composite Repetition-Aware Data Structures
cites work: The level ancestor problem simplified
cites work: Representing trees of higher degree
cites work: Biased Search Trees
cites work: Time-space trade-offs for Lempel-Ziv compressed indexing
cites work: Tight Bounds for Top Tree Compression
cites work: Top Tree Compression of Tries.
cites work: Deterministic Indexing for Packed Strings
cites work: Tree compression with top trees
cites work: Random Access to Grammar-Compressed Strings and Trees
cites work: Lower bounds for orthogonal range searching: I. The reporting case
cites work: Simplex range reporting on a pointer machine
cites work: Compressed indexing with signature grammars
cites work: Self-Indexed Grammar-Based Compression
cites work: Q4037405
cites work: Variations on the Common Subexpression Problem
cites work: Slowing Down Top Trees for Better Worst-Case Compression
cites work: A Faster Grammar-Based Self-index
cites work: LZ77-Based Self-indexing with Faster Pattern Matching
cites work: Fast compressed tries through path decompositions
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: Data Structures for Path Queries
cites work: Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
cites work: Efficient randomized pattern-matching algorithms
cites work: Q5585021
cites work: Fast Pattern Matching in Strings
cites work: Q4432981
cites work: Q5708460
cites work: Storage and Retrieval of Individual Genomes
cites work: Compressed representations of sequences and full-text indexes
cites work: Universal compressed text indexing
cites work: Dynamic index and LZ factorization in compressed space
cites work: Convex hulls of finite sets of points in two and three dimensions
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
cites work: Q4472515
cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
cites work: Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
cites work: Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
cites work: A class of algorithms which require nonlinear time to maintain disjoint sets
DOI: 10.1007/S00453-021-00869-W
description: scientific article; zbMATH DE number 7458813