Arseny M. Shur

This paper introduces an algorithm to compute minimum-density minimizers for high-throughput sequencing, achieving faster results than brute-force methods.

This paper introduces 10-minimizers, a class of constant-space minimizers with lower density than random minimizers and efficient k-mer key retrieval.

GreedyMini generates DNA minimizers with low expected density, improving HTS analysis performance and approaching theoretical lower bounds.