Premium
Toward deterministic and semiautomated SPADE analysis
Author(s) -
Qiu Peng
Publication year - 2017
Publication title -
cytometry part a
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.316
H-Index - 90
eISSN - 1552-4930
pISSN - 1552-4922
DOI - 10.1002/cyto.a.23068
Subject(s) - computer science , cluster analysis , visualization , data mining , robustness (evolution) , tree (set theory) , hierarchical clustering , algorithm , artificial intelligence , mathematics , mathematical analysis , biochemistry , chemistry , gene
SPADE stands for spanning‐tree progression analysis for density‐normalized events. It combines downsampling, clustering and a minimum‐spanning tree to provide an intuitive visualization of high‐dimensional single‐cell data, which assists with the interpretation of the cellular heterogeneity underlying the data. SPADE has been widely used for analysis of high‐content flow cytometry data and CyTOF data. The downsampling and clustering components of SPADE are both stochastic, which lead to stochasticity in the tree visualization it generates. Running SPADE twice on the same data may generate two different tree structures. Although they typically lead to the same biological interpretation of subpopulations present in the data, robustness of the algorithm can be improved. Another avenue of improvement is the interpretation of the SPADE tree, which involves visual inspection of multiple colored versions of the tree based on expression of measured markers. This is essentially manual gating on the SPADE tree and can benefit from automated algorithms. This article presents improvements of SPADE in both aspects above, leading to a deterministic SPADE algorithm and a software implementation for semiautomated interpretation. © 2017 International Society for Advancement of Cytometry