OptiK: An Entropy-Driven Framework for Optimal k-mer Size Selection for Bacterial Genomics
Abstract
K-mer-based approaches have become fundamental (Zielezinski et al., 2017) to modern computational genomics, underpinning tools for genome assembly, metagenomic classification, variant calling, and phylogenetic analysis. Despite their ubiquity, selecting an appropriate k-mer size (k) is often made arbitrarily or heuristically, with little consideration for the underlying signal quality relative to a given dataset. Here, I introduce OptiK, a novel alignment-free tool that evaluates the information richness of k-mer encodings across a range of k values to identify the optimal k for comparative analysis. OptiK operates by constructing k-mer frequency matrices from genome collections, reducing their dimensionality via truncated singular value decomposition (SVD), and evaluating clustering structure through unsupervised metrics including the Silhouette coefficient, Calinski-Harabasz index, and Davies-Bouldin index. We validate OptiK on a curated dataset of 1044 Helicobacter pylori genomes with well-characterized population structure. OptiK robustly identifies k = 8 as the optimal k-mer size, yielding latent structures in UMAP space that align with fineSTRUCTURE-defined subpopulations without relying on prior labels or reference alignments. These results demonstrate that OptiK provides a reproducible, alignment-free strategy for optimizing k-mer resolution in bacterial comparative genomics.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Organism
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Ok-k-mer: Selecting k-mer length ensembles for calculating genomic distance
Stephen Hwang, Ben Langmead·bioRxiv·Nov 9, 2026
- Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes
Jarno Alanko, Jaakko Vuohtoniemi, … Simon J. Puglisi·BioinformaticsPeer-reviewed·May 24, 2023
- Compact and evenly distributed k-mer binning for genomic sequences
Johan Nyström-Persson, Gabriel Keeble‐Gagnère, Niamat Zawad·BioinformaticsPeer-reviewed·Mar 3, 2021
- Optimized k-mer search across millions of bacterial genomes on laptops
Francesca Brunetti, Karel Břinda·bioRxiv·Nov 23, 2025
- KPop: Accurate and scalable comparative analysis of microbial genomes by sequence embeddings
Xavier Didelot, Paolo Ribeca·Genome biologyPeer-reviewed·Jun 18, 2025
- CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices
Shaopeng Liu, David Koslicki·BioinformaticsPeer-reviewed·Apr 14, 2022