OBIKmers/obikmer
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 34 Wiki Activity

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.
Eric Coissac committed 2026-09-12 12:29:53 +02:00
1 parent 612b813190
commit 413db85400
1 file changed
+2
Download Patch File Download Diff File Expand all files Collapse all files
theory-minimizer_selection.md
+2
@@ -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: