Enhancing generalized compressed suffix trees, with applications
From MaRDI portal
Cites work
- A data structure for dynamic trees
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- A uniform paradigm to succinctly encode various families of trees
- Algorithms on Strings, Trees and Sequences
- Approximate suffix-prefix dictionary queries
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- Dynamic weighted ancestors
- Fibonacci heaps and their uses in improved network optimization algorithms
- Fully functional static and dynamic succinct trees
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 7695994 (Why is no real title available?)
- Indexing compressed text
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Optimal lower and upper bounds for representing sequences
- Rank/select operations on large alphabets
- Replacing suffix trees with enhanced suffix arrays
- Space efficient suffix trees
- Succinct data structures for flexible text retrieval systems
- Succinct data structures for nearest colored node in a tree
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct representation of balanced parentheses and static trees
- Suffix Arrays: A New Method for On-Line String Searches
- Suffix-prefix queries on a dictionary
- Weighted ancestors in suffix trees
This page was built for publication: Enhancing generalized compressed suffix trees, with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260629)
