The following pages link to Compressed suffix trees (Q5178740):
Displaying 8 items.
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- The longest common substring problem (Q2971067) (← links)
- (Q5090335) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
