An Algorithmic Pipeline for Analyzing Multi-parametric Flow Cytometry Data
Flow cytometry (FC) is a single-cell profiling platform for measuring the phenotypes of individual cells from millions of cells in biological samples. FC employs high-throughput technologies and generates high-dimensional data, and hence algorithms for analyzing the data represent a bottleneck. This dissertation addresses several computational challenges arising in modern cytometry while mining information from high-dimensional and high-content biological data. A collection of combinatorial and statistical algorithms for locating, matching, prototyping, and classifying cellular populations from multi-parametric FC data is developed. The algorithmic pipeline, flowMatch, developed in this dissertation consists of five well-defined algorithmic modules to (1) transform data to stabilize within-population variance, (2) identify cell populations by robust clustering algorithms, (3) register cell populations across samples, (4) encapsulate a class of samples with templates, and (5) classify samples based on their similarity with the templates. Components of flowMatch can work independently or collaborate with each other to perform the complete data analysis. flowMatch is made available as an open-source R package in Bioconductor. We have employed flowMatch for classifying leukemia samples, evaluating the phosphorylation effects on T cells, classifying healthy immune profiles, and classifying the vaccination status of HIV patients. In these analyses, the pipeline is able to reach biologically meaningful conclusions quickly and efficiently with the automated algorithms. The algorithms included in flowMatch can also be applied to problems outside of flow cytometry such as in microarray data analysis and image recognition. Therefore, this dissertation contributes to the solution of fundamental problems in computational cytometry and related domains.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
GPDFlow: Generative Multivariate Threshold Exceedance Modeling via Normalizing Flows
The multivariate generalized Pareto distribution (mGPD) is a common method for modeling extreme threshold exceedance probabilities in environmental and financial risk management. Despite its broad applicability, mGPD fac…
Fast L1-NMF for Multiple Parametric Model Estimation
In this work we introduce a comprehensive algorithmic pipeline for multiple parametric model estimation. The proposed approach analyzes the information produced by a random sampling algorithm (e.g., RANSAC) from a machin…
modelparameter estimationExpert-elicitation method for non-parametric joint priors using normalizing flows
We propose an expert-elicitation method for learning non-parametric joint prior distributions using normalizing flows. Normalizing flows are a class of generative models that enable exact, single-step density evaluation …
Decision MakingA Unifying View of Variational Generative Wasserstein Flows
Many modern generative models can be viewed as minimizing divergences between probability distributions, yet they rely on different algorithmic and geometric principles. Wasserstein gradient flows provide a continuous-ti…
What's in the Flow? Exploiting Temporal Motion Cues for Unsupervised Generic Event Boundary Detection
Generic Event Boundary Detection (GEBD) task aims to recognize generic, taxonomy-free boundaries that segment a video into meaningful events. Current methods typically involve a neural model trained on a large volume of …
Boundary DetectionGeneric Event Boundary DetectionOptical Flow Estimation