Table of Contents NotesColoured Tree Problem Generic sparse suffix array Sparse suffix array on minimizers Discussion / TODOsEvals These are my running notes on implementing an algorithm for Longest Common Repeat using minimizers. Notes Coloured Tree Problem See Lemma 3 at here Generic sparse suffix array paper: https://arxiv.org/pdf/2310.09023.pdf code: https://github.com/lorrainea/SSA/blob/main/PA/ssa.cc For random strings and \(b \leq n / \log n\), direct radix sort on $2log n + log log n$...
