A fixed budget near 2,000 HVGs is frequently suboptimal, and list cardinality is a separable design axis that can be automated without changing the ranking formula.
Abstract
Background Highly variable gene (HVG) selection begins almost every single-cell RNA-seq analysis. While ranking formulas have been compared extensively, the integer gene budget at which any ranking must be truncated is typically left to the user and habitually fixed near 2,000. Relying on such a convention carries hidden costs—lists that are too short erase subtle structure, whereas lists that are too long add noise and computational overhead. Moreover, because global rankings measure variance across all cells, markers for rare populations often lose the “variance vote count” to dominant bulk variation, leading to an unfair feature allocation at the hard cutoff. Whether this convention is defensible, and whether the budget and tail can be set from data without disturbing the ranking, has not been examined systematically. Results Under a frozen seurat_v3 ranking, k-sweeps across 18 labeled datasets show that n = 2,000 is ARI-optimal on 1 of 18 datasets and that the best available budget is worth a mean ARI gain of +0.033 over it, establishing cardinality as a real and largely unexploited design axis. We present scFair, a Scanpy-compatible HVG layer that automates list length alone: geometry-aware auto_n sets a base size k from multi-seed density and stability features of an intermediate embedding (trading a modest, intentional compute increase for a safer data-driven default), and a same-rank append step acts as a conservative safeguard against cutoff unfairness by adding a short near-miss tail. The ranking is never recomputed or reweighted. On the 18-dataset panel, the default path improved Leiden–label agreement over HVG@2000 (median ΔARI = +0.016; 13/5; Wilcoxon P = 0.0077) and outperformed the neighborhood-based selector triku at author defaults on 15/18 datasets (median +0.024; P = 0.004), while triku did not improve on HVG@2000. Controls locate the effect: cell-number-only rules do not beat HVG@2000, an FDR-chosen length imposed on the frozen ranking is flat, and a fixed HVG@2200 default is not a general substitute because it cannot produce the short lists that compact matrices call for. Conclusions A fixed budget near 2,000 HVGs is frequently suboptimal, and list cardinality is a separable design axis that can be automated without changing the ranking formula. Effect sizes are modest, the short-list branch rests on four datasets, and rule thresholds were developed with partial overlap to the evaluation panel.
Predicting cellular responses to genetic perturbations helps prioritize experiments in single-cell genomics, where exhaustive measurement is infeasible. While computational models increasingly predict these responses, three evaluation deficiencies obscure what their scores demonstrate. First, absolute metrics cannot se...
Si-Kai Huang, Zhi-Wen Yang, Kai Yu et al.· 0 citations
It is found that many GigaRef singletons belong to a cluster under alternative parameter settings, suggesting that genomic and metagenomic datasets may require dataset-specific clustering configurations, and it is shown that singletons share mutual information with clustered sequences, making them learnable by PLMs and...
R. Vinod, Samir Char, Ava A. Amini et al.· bioRxiv· 0 citations
This work uses a general-purpose "post-training" algorithm grounded in statistical physics that employs quantitative experimental rankings to directly produce a sampler for diverse, high fitness sequences with fewer data points than competing methods.
Sebastian Ibarraran, Shriram Chennakesavalu, Frank Hu et al.· Journal of Chemical Informat...· 0 citations
This work proves equivalence to the dense recurrence in real arithmetic, under an explicit scalar branch-interface assumption, and applies candidate sparsification to the multiloop recurrence of a Turner~2004 dangle-0 solver over a weighted codon automaton.
Abstract Single-cell RNA sequencing provides an unprecedented resolution for cellular heterogeneity and gene regulation, fostering cross-species comparative analyses with increasing interspecies data. However, integrating single-cell transcriptomic data faces challenges, including gene selection, evolutionary distance,...
Ruo-Lin Wang, Jun-Juan Zheng, C. Mao et al.· Briefings in Bioinformatics· 0 citations
MOTIVATION
Gene-expression programs (GEPs) are the co-regulated gene modules whose coordinated activity encodes biological processes. Recovering them from single-cell RNA-seq is hard because regulation is many-to-many. A cell can run several programs at once, and a gene can take part in several. Methods that resolve pr...
Yanir Buznah, Tal Ishon, Uri Shaham· Bioinformatics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.