Ultra-succinct representation of ordered trees with applications
From MaRDI portal
(Redirected from Publication:414928)
Recommendations
Cites work
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- A Uniform Approach Towards Succinct Representation of Trees
- A simple optimal representation for balanced parentheses
- A simple storage scheme for strings achieving entropy bounds
- Algorithms and Computation
- Algorithms on Strings, Trees and Sequences
- Automata, Languages and Programming
- Balanced parentheses strike back
- Binary trees having a given number of nodes with 0, 1, and 2 children
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- Compressing and indexing labeled trees, with applications
- Computing and Combinatorics
- Engineering a compressed suffix tree implementation
- Fully-functional succinct trees
- Indexing compressed text
- Low redundancy in static dictionaries with constant query time
- New text indexing functionalities of the compressed suffix arrays
- Orderly Spanning Trees with Applications
- Representing trees of higher degree
- Space efficient suffix trees
- Squeezing succinct data structures into entropy bounds
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct ordinal trees with level-ancestor queries
- Succinct representation of balanced parentheses and static trees
- Time-space trade-offs for compressed suffix arrays.
- Ultra-succinct representation of ordered trees
- Universal Succinct Representations of Trees?
Cited in
(29)- Efficient Schemes for Computing α-tree Representations
- Compact navigation and distance oracles for graphs with small treewidth
- A uniform paradigm to succinctly encode various families of trees
- Improved range minimum queries
- Adaptive succinctness
- A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
- Universal Succinct Representations of Trees?
- Fast compressed tries through path decompositions
- Compressed directed acyclic word graph with application in local alignment
- Representation of ordered trees with a given degree distribution
- Succinct representations of ordinal trees
- Generation matrix: an embeddable matrix representation for hierarchical trees
- Dualities in tree representations
- Compressed Multiple Pattern Matching
- Encoding range minima and range top-2 queries
- Ultra-succinct representation of ordered trees
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
- Lempel-Ziv factorization powered by space efficient suffix trees
- Fully functional static and dynamic succinct trees
- Short Transitive Signatures for Directed Trees
- Efficient computation of Lyapunov functions for Morse decompositions
- High-order entropy compressed bit vectors with rank/select
- Succinct data structure for dynamic trees with faster queries
- Simple and efficient fully-functional succinct trees
- Succinct dynamic cardinal trees
- A Uniform Approach Towards Succinct Representation of Trees
- Parallel construction of succinct trees
- Random access to grammar-compressed strings and trees
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
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)
