Search bioRxiv⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.64898/2026.03.16.712052

10-minimizers: a promising class of constant-space minimizers

Shur, A.·Tziony, I.·Orenstein, Y.
View original source ↗Export metadata ↓

Abstract

Minimizers are sampling schemes which are ubiquitous in almost any high-throughput sequencing analysis. Assuming a fixed alphabet of size{sigma} , a minimizer is defined by two positive integers k, w and a linear order{rho} on k-mers. A sequence is processed by a sliding window algorithm that chooses in each window of length w + k- 1 its minimal k-mer with respect to{rho} . A key characteristic of a minimizer is its density, which is the expected frequency of chosen k-mers among all k-mers in a random infinite{sigma} -ary sequence. Minimizers of smaller density are preferred as they produce smaller samples, which lead to reduced runtime and memory usage in downstream applications. Recent studies developed methods to generate minimizers with optimal and near-optimal densities, but they require to explicitly store k-mer ranks in{Omega} (2k) space. While constant-space minimizers exist, and some of them are proven to be asymptotically optimal, no constant-space minimizers was proven to guarantee lower density compared to a random minimizer in the non-asymptotic regime, and many minimizer schemes suffer from long k-mer key-retrieval times due to complex computation. In this paper, we introduce 10-minimizers, which constitute a class of minimizers with promising properties. First, we prove that for every k > 1 and every w[≥] k- 2, a random 10-minimizer has, on expectation, lower density than a random minimizer. This is the first provable guarantee for a class of minimizers in the non-asymptotic regime. Second, we present spacers, which are particular 10-minimizers combining three desirable properties: they are constant-space, low-density, and have small k-mer key-retrieval time. In terms of density, spacers are competitive to the best known constant-space minimizers; in certain (k, w) regimes they achieve the lowest density among all known (not necessarily constant-space) minimizers. Notably, we are the first to benchmark constant-space minimizers in the time spent for k-mer key retrieval, which is the most fundamental operation in many minimizers-based methods. Our empirical results show that spacers can retrieve k-mer keys in competitive time (a few seconds per genome-size sequence, which is less than required by random minimizers), for all practical values of k and w. We expect 10-minimizers to improve minimizers-based methods, especially those using large window sizes. We also propose the k-mer key-retrieval benchmark as a standard objective for any new minimizer scheme.

Explore related subjects

bioinformaticsPreprint

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shur, A., Tziony, I., Orenstein, Y.. 2026-03-18. 10-minimizers: a promising class of constant-space minimizers. https://doi.org/10.64898/2026.03.16.712052

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

Targeted finetuning enables co-folding models to learn ligand-induced protein conformational states

Advances in protein structure prediction have enabled all-atom protein-ligand co-folding models that predict bound conformations directly from sequence and small-molecule structure. However, these models often fail to generalize to novel binding sites or alternative protein conformational states, limiting their utility for chemical biology and drug discovery. Here we show this limitation reflects training data bias rather than architectural constraints and can be overcome through targeted finetuning. Using ten previously unseen X-ray structures of Werner (WRN) helicase from a drug discovery program, we finetune Boltz-1 to learn both an allosteric binding site and a large conformational change locking the enzyme in an inactive state, while preserving accuracy on the ATP-bound state. The finetuned model generalizes to different chemical series and transfers the conformational logic across RecQ-family helicases in a binding-site sequence-dependent manner. This approach provides a blueprint for adapting foundation models as new structural and mechanistic data emerge, enabling co-folding networks to capture ligand-induced conformational switches and binding poses absent from their training data but central to biological regulation and therapeutic intervention.

bioinformatics↗
bioRxiv2026

Benchmarking single-cell foundation models for aging biology

Single cell foundation models (scFMs) provide representations of cellular states, but their utility across biological questions in aging research remains unclear. We established a benchmark of cellular representations for aging research, evaluating ten general-purpose scFMs, three aging-specific models and conventional methods across five biological questions using more than 2.5 million single cell transcriptomes. Using frozen pretrained representations, Geneformer performed best among scFMs for chronological age prediction and age pseudotime concordance, although 2,000 highly variable genes achieved higher mean performance. Several scFMs captured positive molecular age shifts across three disease contexts, consistent with reported aging-associated changes. SCimilarity performed well for rare cellular state identification across out-of-distribution datasets, exceeding aging specific models and conventional baselines. At the gene level, scGPT showed the highest recovery of reference TF target interactions, including aging-related regulatory hubs. Overall, scFMs supported diverse aging analyses, but performance depended on the biological question, highlighting their utility for rare cellular state identification and regulatory analysis.

bioinformatics↗
bioRxiv2026

CryoMV: Structure-Prior-Guided Modeling and Real-Particle Validation of Continuous Conformational Transitions in Cryo-EM

Continuous protein conformations are essential for understanding fundamental biological processes and supporting drug discovery. Although cryo-EM can resolve individual states at high resolution, recovering continuous heterogeneity from 2D particle images remains challenging. High noise, motion blur, and limited structural priors make it difficult to accurately generate and validate high-resolution continuous conformations using raw particle data. Here, we introduce cryoMV, a framework that integrates structure-prior-guided modeling with real-particle validation for continuous conformational transitions. CryoMV uses reference density maps to establish structural anchors and motion priors, models candidate transition paths between selected conformations, and transfers the learned representation to raw 2D cryo-EM particle images. Each candidate conformation is subsequently evaluated using the estimated particle poses and contrast transfer functions. Supported conformations are reconstructed through raw particle back-projection and assessed using canonical half-maps and Fourier shell correlation. On EMPIAR-10516 and EMPIAR-10345, cryoMV achieves excellent performance in terms of robustness, verifiability, and reconstruction resolution. By incorporating structure-prior modeling and evidence from the raw particles, cryoMV offers an explicit mechanism for assessing whether generated conformations are supported by experimental data and provides a practical approach to reducing model-induced artifacts in continuous cryo-EM heterogeneity analysis.

bioinformatics↗