Ultra-succinct representation of ordered trees with applications
type: Item
instance of: scholarly article
title: Ultra-succinct representation of ordered trees with applications
zbMATH Open document ID: 1242.68083
author: Jesper Jansson
author: Kunihiko Sadakane
author: Wing-Kin Sung
published in: Journal of Computer and System Sciences
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 6033514
zbMATH Keywords: succinct data structure
zbMATH Keywords: ordered tree
zbMATH Keywords: tree degree entropy
zbMATH Keywords: xbw
zbMATH Keywords: compressed suffix tree
describes a project that uses: PATRICIA
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.09.002
OpenAlex ID: W1973883768
cites work: Representing trees of higher degree
cites work: Orderly Spanning Trees with Applications
cites work: A Uniform Approach Towards Succinct Representation of Trees
cites work: Universal Succinct Representations of Trees?
cites work: Compressing and indexing labeled trees, with applications
cites work: Indexing compressed text
cites work: A simple storage scheme for strings achieving entropy bounds
cites work: A simple optimal representation for balanced parentheses
cites work: Succinct ordinal trees with level-ancestor queries
cites work: Q4471381
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: Algorithms on Strings, Trees and Sequences
cites work: Algorithms and Computation
cites work: Q2934640
cites work: Balanced parentheses strike back
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Succinct representation of balanced parentheses and static trees
cites work: Space efficient suffix trees
cites work: Automata, Languages and Programming
cites work: Low redundancy in static dictionaries with constant query time
cites work: Computing and Combinatorics
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Time-space trade-offs for compressed suffix arrays.
cites work: Binary trees having a given number of nodes with 0, 1, and 2 children
cites work: New text indexing functionalities of the compressed suffix arrays
cites work: Compressed suffix trees with full functionality
cites work: Squeezing succinct data structures into entropy bounds
cites work: Q5417613
cites work: Engineering a compressed suffix tree implementation
DOI: 10.1016/J.JCSS.2011.09.002
description: scientific article; zbMATH DE number 6033514