A new dynamic program finds the minimum-density minimizer in w·2^{σ^k+O(k)} time, and a regular-language method gives eventually optimal orders for small alphabets.
Greedymini: Generating low-density DNA minimizers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On Minimizers of Minimum Density
A new dynamic program finds the minimum-density minimizer in w·2^{σ^k+O(k)} time, and a regular-language method gives eventually optimal orders for small alphabets.