Pages that link to "Item:Q5150930"
From MaRDI portal
The following pages link to Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930):
Displaying 8 items.
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- Detecting Mutations by eBWT (Q5090327) (← links)
- (Q5090335) (← links)
- Space-efficient merging of succinct de Bruijn graphs (Q6536265) (← links)
