The following pages link to (Q4828936):
Displaying 27 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- Opportunistic data structures for range queries (Q2498981) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Array Range Queries (Q2848983) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- (Q3304151) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- The Heaviest Induced Ancestors Problem Revisited (Q5140784) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Compressed indexes for approximate string matching (Q5961970) (← links)
