Pages that link to "Item:Q2628803"
From MaRDI portal
The following pages link to Lightweight LCP construction for very large collections of strings (Q2628803):
Displaying 12 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- Detecting Mutations by eBWT (Q5090327) (← links)
- (Q5090335) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
