Search

Visual example of the minimizer and open syncmer selection methods

4.5 (462) · $ 5.99 · In stock

Visual example of the minimizer and open syncmer selection methods
Seed uniqueness and time allocation in strobealign. A The expected

Seed uniqueness and time allocation in strobealign. A The expected

Visual example of the minimizer and open syncmer selection methods

Visual example of the minimizer and open syncmer selection methods

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

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

Parameterized syncmer schemes improve long-read mapping

Parameterized syncmer schemes improve long-read mapping

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

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

Speed up of genetic programming versions of Bowtie2 compared to

Speed up of genetic programming versions of Bowtie2 compared to

Run-hitting probabilities (difference from upper bound) for

Run-hitting probabilities (difference from upper bound) for

Comparison of five supervised feature selection algorithms leading

Comparison of five supervised feature selection algorithms leading

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

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

A survey of mapping algorithms in the long-reads era

A survey of mapping algorithms in the long-reads era

Parameterized syncmer schemes improve long-read mapping

Parameterized syncmer schemes improve long-read mapping

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

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

Using syncmers improves long-read mapping

Using syncmers improves long-read mapping