None
EN
Notes on implementing Longest Common Repeat (LCR)
['Ragnar', 'Groot Koerkamp']
home on CuriousCoding
Sparse suffix array on minimizers Link to heading Radix sort the suffixes of length \(2\cdot w\) starting at each minimizer in \(O(2/w \cdot 2w \cdot n) = O(n)\) time. Fir radix sort, only then sort unresolved suffices using minimizer doubling or PA.