Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.01218 v2 pith:7GB7ANQ4 submitted 2021-02-01 q-bio.GN cs.LGmath.OC

classification q-bio.GNcs.LGmath.OC
keywords distancegenecostmovercellsexpressionfunctiongenes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Unsupervised Ground Metric Learning

    math.OC 2025-07 conditional novelty 7.0 of 10

    New convergence proofs for stochastic fixed-point iterations in unsupervised ground metric learning, with extensions to Mahalanobis and graph Laplacian distances.

  2. Flowing Datasets with Wasserstein over Wasserstein Gradient Flows

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A new gradient flow framework on the space of probability distributions over probability distributions is introduced and applied to flowing labeled datasets between domains.

Pith tools