Table of Contents Background$k$-mers Sketching MinHash Introduction Hamming Similarity SearchImproving performance Analysis Pruning false positive candidate matches Phylogeny reconstructionRunning the algorithm Assembly \[ \newcommand{\vp}{\varphi} \newcommand{\A}{\mathcal A} \newcommand{\O}{\mathcal O} \newcommand{\N}{\mathbb N} \newcommand{\ed}{\mathrm{ed}} \newcommand{\mh}{\mathrm{mh}} \newcommand{\hash}{\mathrm{hash}} \] Background Quickly finding similar pieces of DNA within large datase...
