Pages that link to "Item:Q2376799"
From MaRDI portal
The following pages link to Computing the longest common prefix array based on the Burrows-Wheeler transform (Q2376799):
Displaying 15 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Edge minimization in de Bruijn graphs (Q2672229) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Faster Lightweight Lempel-Ziv Parsing (Q2946413) (← links)
- Longest Common Prefix with Mismatches (Q2949838) (← links)
- Sampled Longest Common Prefix Array (Q3575250) (← links)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Better External Memory LCP Array Construction (Q4629538) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- LCP Array Construction in External Memory (Q5266615) (← links)
- The colored longest common prefix array computed via sequential scans (Q6109741) (← links)
- Longest common prefix arrays for succinct \(k\)-spectra (Q6545406) (← links)
