henhaobio
Sign in

BioinformaticsBioinformaticsPeer-reviewed journal article

PARC: ultrafast and accurate clustering of phenotypic data of millions of single cells

Shobana V. StasseniD, Dickson M. D. SiuiD, Kelvin C. M. LeeiD, Joshua W. K. HoiD, Hayden Kwok‐Hay SoiD, Kevin K. TsiaiD

PDFDOIPreprintCode

Abstract

MotivationNew single-cell technologies continue to fuel the explosive growth in the scale of heterogeneous single-cell data. However, existing computational methods are inadequately scalable to large datasets and therefore cannot uncover the complex cellular heterogeneity.\n\nResultsWe introduce a highly scalable graph-based clustering algorithm PARC - phenotyping by accelerated refined community-partitioning - for ultralarge-scale, high-dimensional single-cell data (> 1 million cells). Using large single cell mass cytometry, RNA-seq and imaging-based biophysical data, we demonstrate that PARC consistently outperforms state-of-the-art clustering algorithms without sub-sampling of cells, including Phenograph, FlowSOM, and Flock, in terms of both speed and ability to robustly detect rare cell populations. For example, PARC can cluster a single cell data set of 1.1M cells within 13 minutes, compared to >2 hours to the next fastest graph-clustering algorithm, Phenograph. Our work presents a scalable algorithm to cope with increasingly large-scale single-cell analysis.\n\nAvailability and Implementationhttps://github.com/ShobiStassen/PARC

Citations
134
FWCI
6.08
Field percentile
top 2%

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISBodenheimer '20Ye '19Abdelaal '20Zou '21Li '22Quah '22
80% semantic matchBioinformatics
Tom Bodenheimer, Mahantesh M. Halappanavar, Stuart R. Jefferys+6 more·bioRxiv·Jun 19, 2020· 25 citations