Space efficient suffix trees
From MaRDI portal
Recommendations
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- Time-space trade-offs for compressed suffix arrays.
- scientific article; zbMATH DE number 871936
Cited in
(62)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Compact searchable static binary trees
- Faster entropy-bounded compressed suffix trees
- Suffix trees on words
- Practical compressed suffix trees
- The suffix binary search tree and suffix AVL tree
- Time-space trade-offs for compressed suffix arrays.
- Approximate query processing over static sets and sliding windows
- Sliding suffix tree
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- ESP-index: a compressed index based on edit-sensitive parsing
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- On the succinct representation of equivalence classes
- Parallel construction of succinct trees
- Optimal lower bounds for rank and select indexes
- Constructing suffix arrays in linear time
- Fully functional static and dynamic succinct trees
- Succinct representations of ordinal trees
- Suffix tree of alignment: an efficient index for similar data
- Dynamic dictionary matching and compressed suffix trees
- A categorization theorem on suffix arrays with applications to space efficient text indexes
- Succinct indexes for strings, binary relations and multi-labeled trees
- Alphabet-dependent string searching with wexponential search trees
- Semi-dynamic compact index for short patterns and succinct van Emde Boas tree
- Linear-size suffix tries
- An estimation of the size of non-compact suffix trees
- Suffix Arrays: A New Method for On-Line String Searches
- The string B-tree
- Succinct indexes for strings, binary relations and multilabeled trees
- Space-efficient frameworks for top-k string retrieval
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Succinct oblivious RAM
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- Online Suffix Tree Construction for Streaming Sequences
- The virtual suffix tree
- Cross-document pattern matching
- Ultra-succinct representation of ordered trees with applications
- scientific article; zbMATH DE number 2081033 (Why is no real title available?)
- scientific article; zbMATH DE number 1794218 (Why is no real title available?)
- Sparse suffix tree construction in optimal time and space
- scientific article; zbMATH DE number 871936 (Why is no real title available?)
- Sparse text indexing in small space
- Inferring strings from suffix trees and links on a binary alphabet
- Approximate query processing over static sets and sliding windows
- Sparse suffix tree construction in small space
- Combined data structure for previous- and next-smaller-values
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- Space-efficient data structure for next/previous larger/smaller value queries
- Sparse suffix trees
- Space-efficient data structure for next/previous larger/smaller value queries
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Enhancing generalized compressed suffix trees, with applications
- Optimal static fully indexable dictionaries
- A simple optimal representation for balanced parentheses
- Indexing text using the Ziv--Lempel trie
- Succinct data structures for flexible text retrieval systems
- Improved approximate string matching using compressed suffix data structures
- On-line construction of compact suffix vectors and maximal repeats
This page was built for publication: Space efficient suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729650)
