Pages that link to "Item:Q2220837"
From MaRDI portal
The following pages link to Space-efficient construction of compressed suffix trees (Q2220837):
Displaying 10 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- XBWT tricks (Q1796830) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Compressed Cache-Oblivious String B-tree (Q2849337) (← links)
- (Q4875211) (← links)
- Engineering a compressed suffix tree implementation (Q5406217) (← links)
- Comparative genomics with succinct colored de Bruijn graphs (Q6658084) (← links)