From 413db854004974ed9dbdeaceda035eb30dca5ea0 Mon Sep 17 00:00:00 2001 From: Eric Coissac Date: Sat, 12 Sep 2026 12:29:47 +0200 Subject: [PATCH] Document minimizer selection independence Update documentation clarifying that partition routing is independent of minimizer selection and details how minimizer selection and super-kmer routing hashes are computed separately. --- theory-minimizer_selection.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/theory-minimizer_selection.md b/theory-minimizer_selection.md index 87f5500..06fda08 100644 --- a/theory-minimizer_selection.md +++ b/theory-minimizer_selection.md @@ -46,6 +46,8 @@ The choice of $s$ is not arbitrary. Low-complexity m-mers (homopolymers, short t | 13 | 33759044 | `GAAATACTTCACA` | 13 | | 15 | 29869313 | `AACTACTTACCAAAC` | 15 | +If the minimum period length is found to be $m$ as observed in the above table, then the sequence is aperiodic, as no shorter period can be identified. + ## Partition routing is independent of minimizer selection The hash used to select a minimizer within a window (the minimum of several hash values) and the hash used to route a super-kmer to a storage partition are computed separately: