The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Not on the map. Why?
Abstract (arXiv)
This paper introduces the Gene Mover's Distance, a measure of similarity between a pair of cells based on their gene expression profiles obtained via single-cell RNA sequencing. The underlying idea of the proposed distance is to interpret the gene expression array of a single cell as a discrete probability measure. The distance between two cells is hence computed by solving an Optimal Transport problem between the two corresponding discrete measures. In the Optimal Transport model, we use two types of cost function for measuring the distance between a pair of genes. The first cost function exploits a gene embedding, called gene2vec, which is used to map each gene to a high dimensional vector: the cost of moving a unit of mass of gene expression from a gene to another is set to the Euclidean distance between the corresponding embedded vectors. The second cost function is based on a Pearson distance among pairs of genes. In both cost functions, the more two genes are correlated, the lower is their distance. We exploit the Gene Mover's Distance to solve two classification problems: the classification of cells according to their condition and according to their type. To assess the impact of our new metric, we compare the performances of a k-Nearest Neighbor classifier using different distances. The computational results show that the Gene Mover's Distance is competitive with the state-of-the-art distances used in the literature.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 4 of its 48 references that are in the map. First posted on arXiv 1 Feb 2021.
Builds on
4 of 48 references.
References · 4
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2018Computational Optimal Transportcited by 765
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2016Inference for Empirical Wasserstein Distances on Finite Spacescited by 21
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 3; 2025: 2.
8 papers.
- 2021Unsupervised Ground Metric Learning using Wasserstein Singular Vectorscited by 5
- 2024Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchycited by 5
- 2021Embedding Signals on Knowledge Graphs with Unbalanced Diffusion Earth Mover's Distancecited by 4
- 2023Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applicationscited by 1
- 2024Low dimensional representation of multi-patient flow cytometry datasets using optimal transport for minimal residual disease detection in leukemiacited by 1
- 2024Fast unsupervised ground metric learning with tree-Wasserstein distancecited by 1
- 2025Unsupervised Ground Metric Learningcited by 1
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicingcited by 1
- 2025Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing6 Oct 2025
- 2025Unsupervised Ground Metric Learning17 Jul 2025
- 2024Fast unsupervised ground metric learning with tree-Wasserstein distance11 Nov 2024
- 2024Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy28 Oct 2024
- 2024Low dimensional representation of multi-patient flow cytometry datasets using optimal transport for minimal residual disease detection in leukemia24 Jul 2024
- 2023Leveraging Optimal Transport via Projections on Subspaces for Machine Learning Applications23 Nov 2023
- 2021Embedding Signals on Knowledge Graphs with Unbalanced Diffusion Earth Mover's Distance26 Jul 2021
- 2021Unsupervised Ground Metric Learning using Wasserstein Singular Vectors11 Feb 2021