Karel BŘinda

Pareto Optimization of Masked Superstrings Improves Compression of Pan-Genome k -Mer Sets

The growing interest in k -mer-based methods across bioinformatics calls for compact k -mer set representations that can be optimized for specific downstream applications. Recently, masked superstrings (MS) have provided such flexibility by moving beyond de Bruijn graph paths to general k -mer superstrings equipped wit...