Skip to content
Open access

Measuring and removing near-duplicate contamination in alignment-free SARS-CoV-2 lineage classification benchmarks

Aug 2026 · bioRxiv · 0 citations · 25 references
Biology

Abstract

Alignment-free lineage assignment from k-mer frequency profiles is widely used for SARS-CoV-2 surveillance, and the methods that do it are ranked against each other by margins of one or two percentage points. Those rankings rest on an unchecked protocol. Public repositories hold many near-duplicate genomes, and stratified random splitting puts members of such a group on both sides of the split, so a classifier is credited for sequences it has already seen. We propose quantised profile hashing, which finds near duplicates in k-mer feature space by rounding each frequency vector and hashing it. No sequence is compared with any other, so one pass over the feature matrix suffices and no similarity threshold has to be chosen. Rounding is also what makes the groups well defined, and they are then kept whole across the training, validation and test sets. On 255,611 genomes from seven Pango lineages, random splitting leaves 5.09% of test sequences with a near duplicate in training, on a benchmark ranked by margins of one or two points. Ten update rules were trained twice, identically except for the partition. The contaminated benchmark separates one rule from the leader at 0.05; the clean one separates none. The two orderings are uncorrelated, Kendall τ = +0.022, with rules moving 3.2 positions on average and the leader of one benchmark ranking eighth on the other. A ranking obtained under contamination therefore says nothing about the ranking without it, and the quantity worth reporting beside a score is the leakage rate of the split.

Read PDF

Similar papers

Preprint Jul 2026

modelDNA: Calibrated Lineage Verification and Merge Decomposition from Sampled Weight Fingerprints

The lineage graph of open-weight language models is self-reported: Hugging Face's base_model metadata field is optional and unverified, and over 60% of Hub models document no parentage at all. Methods for detecting lineage from weights exist in the research literature, but each ships as paper code tied to one signal an...

Muhammad Adil, Saad Aamir · 0 citations
Jul 2026

A Deterministic Binary Fingerprinting Framework with Zero-Trained Feature Extraction for Sparse Count Matrices

MMTB is introduced, a deterministic non-learned binary representation framework that requires no label supervision, model fitting, or gradient-based optimization and is suited for coarse-grained separation and resource-constrained deployments rather than fine-grained subtype discovery.

Lei Zhao, Fujin Huang, Ling Kang et al. · 0 citations
Jul 2026

Benchmarking NACTI Species Recognition in Long-Tailed Regimes

Qualitative and quantitative analyses underline that current LTR optimisations cannot fully overcome representational bottlenecks, resulting in catastrophic predictive breakdown for rare `Tail'classes under severe domain shift.

Zehua Liu, T. Burghardt · 0 citations
Book Open access Jul 2026

Clustering-Guided Knowledge Base for Multi-Objective Rule Mining on Imbalanced Datasets

A clustering-based knowledge base is proposed that captures positive-class structure before search begins and uses it to focus both initialization and neighborhood exploration in Moca-I, a multi-objective local-search algorithm that mines interpretable rule sets by trading off minority-class recall, precision, and comp...

Raymonde Akiki, Chantal Saad Hajjar, Maroun Chamoun et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.