Pages that link to "Item:Q5259552"
From MaRDI portal
The following pages link to Linear time construction of compressed text indices in compact space (Q5259552):
Displaying 16 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- Space-efficient construction of compressed suffix trees (Q2220837) (← links)
- Parallel computation of the Burrows Wheeler transform in compact space (Q2297855) (← links)
- Lightweight merging of compressed indices based on BWT variants (Q2297864) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- (Q5009616) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- (Q5088898) (← links)
- (Q5090335) (← links)
- Greedy Shortest Common Superstring Approximation in Compact Space (Q5150914) (← links)
- Lightweight BWT and LCP Merging via the Gap Algorithm (Q5150930) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
