Pages that link to "Item:Q2465055"
From MaRDI portal
The following pages link to From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055):
Displaying 10 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- A combinatorial view on string attractors (Q2216440) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
- A new class of string transformations for compressed text indexing (Q6053405) (← links)
- \(r\)-indexing the eBWT (Q6543261) (← links)
