Pages that link to "Item:Q4575763"
From MaRDI portal
The following pages link to Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time (Q4575763):
Displaying 18 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← 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)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- (Q5009616) (← links)
- Space-efficient computation of the LCP array from the Burrows-Wheeler transform (Q5088894) (← links)
- (Q5088898) (← links)
- (Q5090335) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
