Back

Benchmarking algorithms for RNA velocity inference

Huang, K.; Zhou, Y.; Wang, T.; Li, X.; Zhao, X.; Liu, X.; Huang, L.; Zhou, X.; Liu, J.

2026-01-03 bioinformatics
10.64898/2026.01.03.697314 bioRxiv
Show abstract

RNA velocity is a computational framework for single-cell RNA sequencing (scRNA-seq) that estimates the future transcriptional state of individual cells, thereby capturing the direction and rate of cell state transitions rather than providing a purely static snapshot. Since its introduction in 2018, multiple RNA velocity methods have been developed, differing in their modeling assumptions, required inputs, computational complexity, and robustness. However, there remains limited consensus on how best to evaluate these methods or on which tools are most reliable under specific biological and technical settings. Here, we perform a systematic comparison of 29 velocity inference algorithms across 114 simulated datasets with known ground-truth cell dynamics and 62 real scRNA-seq datasets, and we extend the evaluation to spatial and multi-omics levels where velocity is increasingly applied. We benchmark RNA velocity methods using a unified framework that decomposes performance into four practical dimensions: accuracy, scalability, stability, and usability. Our results show that performance rankings vary substantially across metrics and datasets, indicating no single method is uniformly optimal and that practical deployment is often constrained by feasibility and robustness as much as by accuracy. Based on these results, we provide actionable guidance for selecting RNA velocity tools according to data modality, available priors, and computational constraints. Finally, we identify key bottlenecks that currently limit RNA velocity development and deployment, including scalability to large size of datasets, sensitivity to gene selection, and the lack of genuinely multimodal and spatially explicit velocity models for spot-based technologies.

Matching journals

The top 2 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.