A framework for succinct labeled ordinal trees over large alphabets
From MaRDI portal
Publication:487027
DOI10.1007/S00453-014-9894-4zbMath1314.68111OpenAlexW2078778545MaRDI QIDQ487027
Gelin Zhou, J. Ian Munro, Meng He
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9894-4
data structuressuccinct data structuresdynamic labeled ordinal treeslabeled ordinal treestree extraction
Related Items (6)
Succinct indices for path minimum, with applications ⋮ Succinct data structures for nearest colored node in a tree ⋮ Unnamed Item ⋮ Dynamic path queries in linear space ⋮ Tree path majority data structures ⋮ Data structures for categorical path counting queries
Cites Work
- Unnamed Item
- Succinct representation of labeled trees
- A survey on tree edit distance and related problems
- Representing trees of higher degree
- A simple storage scheme for strings achieving entropy bounds
- A uniform paradigm to succinctly encode various families of trees
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Fully Functional Static and Dynamic Succinct Trees
- New Lower and Upper Bounds for Representing Sequences
- Succinct Data Structures for Path Queries
- Succinct ordinal trees with level-ancestor queries
- Path Queries in Weighted Trees
- Succinct ordinal trees based on tree covering
- An analysis of the Burrows—Wheeler transform
- Compressing and indexing labeled trees, with applications
- Universal Succinct Representations of Trees?
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Optimal Dynamic Sequence Representations
This page was built for publication: A framework for succinct labeled ordinal trees over large alphabets
