Back to Search Start Over

Graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells

Authors :
Fabian J. Theis
Nikolaus Rajewsky
Joakim S. Dahlin
Berthold Göttgens
Fiona K. Hamey
Mireya Plass
Jordi Solana
Lukas M. Simon
F. Alexander Wolf
Publication Year :
2017
Publisher :
Cold Spring Harbor Laboratory, 2017.

Abstract

Single-cell RNA-seq allows quantification of biological heterogeneity across both discrete cell types and continuous cell differentiation transitions. We present approximate graph abstraction (AGA), an algorithm that reconciles the computational analysis strategies of clustering and trajectory inference by explaining cell-to-cell variation both in terms of discrete and continuous latent variables (https://github.com/theislab/graph_abstraction). This enables to generate cellular maps of differentiation manifolds with complex topologies — efficiently and robustly across different datasets. Extended Abstract Approximate graph abstraction quantifies the connectivity of partitions of a neighborhood graph of single cells, thereby generating a much simpler abstracted graph whose nodes label the partitions. Together with a random walk-based distance measure, this generates a topology preserving map of single cells — a partial coordinatization of data useful for exploring and explaining its variation. We use the abstracted graph to assess which subsets of data are better explained by discrete clusters than by a continuous variable, to trace gene expression changes along aggregated single-cell paths through data and to infer abstracted trees that best explain the global topology of data. We demonstrate the power of the method by reconstructing differentiation processes with high numbers of branchings from single-cell gene expression datasets and by identifying biological trajectories from single-cell imaging data using a deep-learning based distance metric. Along with the method, we introduce measures for the connectivity of graph partitions, generalize random-walk based distance measures to disconnected graphs and introduce a path-based measure for topological similarity between graphs. Graph abstraction is computationally efficient and provides speedups of at least 30 times when compared to algorithms for the inference of lineage trees.

Details

Language :
English
Database :
OpenAIRE
Accession number :
edsair.doi.dedup.....9d37e3682a4bba157a0e86ef370d5384
Full Text :
https://doi.org/10.1101/208819