These are notes for DSB 2023. They’re not very structured though. I usually find methods more interesting than results. Day 1, Tuesday Link to heading Practical data structures for longest common extensions, Alexander Herlez Link to heading LCE: longest common extension: given \(i\), \(j\), the max \(k\) s.t. \(A[i, i+k) = A[j, j+k)\). alg: compare first k if same: sample a subset and use black-box datastructure. similar idea to minhash/mash kmer selection methods, same(?) as syncmers strin...
