The Gene Mover's Distance: Single-cell similarity via Optimal Transport

02/01/2021
by   Riccardo Bellazzi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2019

Training Generative Networks with general Optimal Transport distances

We propose a new algorithm that uses an auxiliary Neural Network to calc...
research
02/08/2023

Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps

Optimal transport (OT) theory focuses, among all maps T:ℝ^d→ℝ^d that can...
research
09/29/2019

Learning transport cost from subset correspondence

Learning to align multiple datasets is an important problem with many ap...
research
06/05/2023

Graph Fourier MMD for Signals on Graphs

While numerous methods have been proposed for computing distances betwee...
research
06/28/2021

Higher-dimensional power diagrams for semi-discrete optimal transport

Efficient algorithms for solving optimal transport problems are importan...
research
09/16/2019

Unaligned Sequence Similarity Search Using Deep Learning

Gene annotation has traditionally required direct comparison of DNA sequ...
research
04/05/2023

Distance maps between Japanese kanji characters based on hierarchical optimal transport

We introduce a general framework for assigning distances between kanji b...

Please sign up or login with your details

Forgot password? Click here to reset