The Interplay Between Sketching and Graph Generation Algorithms in Identifying Biologically Cohesive Cell-Populations in Single-Cell Data

Abstract

High-throughput single-cell immune profiling technologies, such as mass cytometry (CyTOF) and single-cell RNA sequencing measure the expression of multiple proteins or genes across many individual cells within a profiled sample. As it is often of interest to identify particular clusters or cell-populations driving clinical phenotypes or experimental outcomes, there is a critical need to develop automated bioinformatics approaches that can handle a large number of profiled cells. For analyzing multi-sample single-cell datasets at scale, the datasets are usually encoded as a graph, where nodes represent cells and edges imply significant between-cell similarity. As multi-sample single-cell experiments can readily result in millions of profiled cells, the construction and analysis of a graph becomes computationally prohibitive and often requires reducing the dataset size through downsampling as a pre-processing step. Here, we explore the interplay between sketching, or downsampling approaches, and the way in which the graph is constructed on the sketched data for ultimately identifying biologically-meaningful cell-populations. Our results suggest that combining a principled sketching approach with a simple k-nearest neighbor graph representation of the data can identify meaningful subsets of cells as robustly as, and sometimes better than, more sophisticated graph generation approaches. This reveals that the practical concern of downsampling or sketching a limited number of cells is a more critical pre-processing step than how the graph representation is constructed.