Pages that link to "Item:Q5236266"
From MaRDI portal
The following pages link to Optimal Construction of Compressed Indexes for Highly Repetitive Texts (Q5236266):
Displayed 7 items.
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- Block trees (Q2221797) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- (Q5088897) (← links)
- (Q5874481) (← links)
- Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)