Efficient minimizer orders for large values of using minimum decycling sets.

Minimizers are ubiquitously used in data structures and algorithms for efficient searching, mapping, and indexing of high-throughput DNA sequencing data. Minimizer schemes select a minimum -mer in every -long subsequence of the target sequence, where minimality is with respect to a predefined -mer order. Commonly used minimizer orders select more -mers than necessary and therefore provide limited improvement in runtime and memory usage of downstream analysis tasks.