Pages that link to "Item:Q4575764"
From MaRDI portal
The following pages link to Sparse Suffix Tree Construction in Optimal Time and Space (Q4575764):
Displaying 10 items.
- Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction (Q1386367) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Tight lower bounds for the longest common extension problem (Q2628282) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- (Q4818865) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
- Sparse suffix and LCP array: simple, direct, small, and fast (Q6547927) (← links)
