Visual example of the minimizer and open syncmer selection methods

Navigating bottlenecks and trade-offs in genomic data analysis

Parameterized syncmer schemes improve long-read mapping

Minimizer and syncmer schemes. In both examples the lexicographic

Yun William Yu's research works University of Toronto, Toronto

Sequence-specific minimizers via polar sets

Jared Simpson (@jaredtsimpson) / X

Run-hitting probabilities (difference from upper bound) for

Speed up of genetic programming versions of Bowtie2 compared to

Jim Shaw's research works University of Toronto, Toronto (U of T

Comparison of five supervised feature selection algorithms leading

Visual example of the minimizer and open syncmer selection methods

Three examples of mutation configurations and corresponding α

a) Example of selecting minimizers with k = 3, w = 5, and the

A survey of mapping algorithms in the long-reads era

PDF) Differentiable Learning of Sequence-Specific Minimizer