Ultra-succinct representation of ordered trees with applications
DOI10.1016/J.JCSS.2011.09.002zbMATH Open1242.68083OpenAlexW1973883768MaRDI QIDQ414928FDOQ414928
Kunihiko Sadakane, Jesper Jansson, Wing-Kin Sung
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.09.002
Recommendations
Trees (05C05) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Succinct representation of balanced parentheses and static trees
- Succinct ordinal trees with level-ancestor queries
- Compressing and indexing labeled trees, with applications
- Indexing compressed text
- Universal Succinct Representations of Trees?
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Balanced parentheses strike back
- Title not available (Why is that?)
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Representing trees of higher degree
- Compressed suffix trees with full functionality
- A simple storage scheme for strings achieving entropy bounds
- A Space-Economical Suffix Tree Construction Algorithm
- Title not available (Why is that?)
- Computing and Combinatorics
- Space efficient suffix trees
- Low redundancy in static dictionaries with constant query time
- Squeezing succinct data structures into entropy bounds
- New text indexing functionalities of the compressed suffix arrays
- Automata, Languages and Programming
- Binary trees having a given number of nodes with 0, 1, and 2 children
- Orderly Spanning Trees with Applications
- Time-space trade-offs for compressed suffix arrays.
- Title not available (Why is that?)
- A Uniform Approach Towards Succinct Representation of Trees
- Algorithms and Computation
- Engineering a compressed suffix tree implementation
- A simple optimal representation for balanced parentheses
Cited In (29)
- Efficient computation of Lyapunov functions for Morse decompositions
- Succinct dynamic cardinal trees
- Encoding range minima and range top-2 queries
- A uniform paradigm to succinctly encode various families of trees
- High-order entropy compressed bit vectors with rank/select
- Title not available (Why is that?)
- Adaptive succinctness
- Random Access to Grammar-Compressed Strings and Trees
- Lempel-Ziv factorization powered by space efficient suffix trees
- Representation of ordered trees with a given degree distribution
- Generation matrix: an embeddable matrix representation for hierarchical trees
- Short Transitive Signatures for Directed Trees
- Parallel construction of succinct trees
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Compact navigation and distance oracles for graphs with small treewidth
- Fully functional static and dynamic succinct trees
- Simultaneous encodings for range and next/previous larger/smaller value queries
- Succinct Representations of Ordinal Trees
- Compressed Multiple Pattern Matching
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Universal Succinct Representations of Trees?
- Fast compressed tries through path decompositions
- A Uniform Approach Towards Succinct Representation of Trees
- Simple and efficient fully-functional succinct trees
- Efficient Schemes for Computing α-tree Representations
- Compressed directed acyclic word graph with application in local alignment
- Succinct data structure for dynamic trees with faster queries
- Improved range minimum queries
- Tree compression using string grammars
Uses Software
This page was built for publication: Ultra-succinct representation of ordered trees with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414928)
