Table of Contents GreedyMini Results A first look Comparison with optimal ILP values Large alphabets Analysing GreedyMini at \(w=3\) \(w=3\), \(k=3\) \(w=7\), \(k=3\) \(w=3\), \(k=4\) \(w=3\), \(k=5\) \(w=3\), \(k=6\) \(w=3\), \(k=7\) Looking at fixed \(k=5\) \(k=5\), \(w=4\) \(k=5\), \(w=5\) \(k=5\), \(w=6\) \(k=5\), \(w=7\) \(k=5\), \(w=8\) \(k=5\), \(w=12\) Investigating \(w=5\) \(w=5\), \(k=8\) What about \(k = w+1\)? In this post, we will look at the minimizer schemes generated by the gr...| CuriousCoding
Table of Contents 1 Sampling schemes 1.1 Definitions 1.2 Miniception 1.3 Mod-minimizer 1.4 Forward scheme lower bound 1.5 Open syncmer minimizer 1.6 Open-closed minimizer 1.7 New: General mod-minimizer 1.8 Variant: Open-closed minimizer using offsets 2 Selection schemes 2.1 Definition 2.2 Bd-anchors 2.3 New: Smallest unique substring anchors 2.4 New: Anti lexicographic sorting 3 More sampling schemes 3.1 Anti-lex sus-anchors 3.2 Threshold anchors 3.3 The $t$-gap disappears for large alphabets...| CuriousCoding