The following pages link to Space efficient suffix trees (Q2729650):
Displaying 45 items.
- Linear-size suffix tries (Q294967) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- On-line construction of compact suffix vectors and maximal repeats (Q955004) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Compact searchable static binary trees (Q1029045) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Suffix trees on words (Q1283934) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- Time-space trade-offs for compressed suffix arrays. (Q1853020) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Sliding suffix tree (Q2331636) (← links)
- An efficient variable-to-fixed length encoding using multiplexed parse trees (Q2343303) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- ESP-index: a compressed index based on edit-sensitive parsing (Q2376813) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Optimal lower bounds for rank and select indexes (Q2465065) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Fully functional static and dynamic succinct trees (Q2799480) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Dynamic dictionary matching and compressed suffix trees (Q2921649) (← links)
- A categorization theorem on suffix arrays with applications to space efficient text indexes (Q2921650) (← links)
- An Estimation of the Size of Non-Compact Suffix Trees (Q2973237) (← links)
- Suffix Arrays: A New Method for On-Line String Searches (Q3142586) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Succinct oblivious RAM (Q3304151) (← links)
- Online Suffix Tree Construction for Streaming Sequences (Q3628498) (← links)
- THE VIRTUAL SUFFIX TREE (Q3655540) (← links)
- (Q4875211) (← links)
- Sparse Text Indexing in Small Space (Q4962616) (← links)
- Approximate query processing over static sets and sliding windows (Q5091046) (← links)
- Combinatorial Pattern Matching (Q5713567) (← links)
- (Q6065424) (← links)
