MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry

preprint OA: closed
📄 Open PDF Full text JSON View at publisher
Full text 56,214 characters · extracted from preprint-html · click to expand
MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry | bioRxiv /* */ /* */ <!-- <!-- /*! * yepnope1.5.4 * (c) WTFPL, GPLv2 */ (function(a,b,c){function d(a){return"[object Function]"==o.call(a)}function e(a){return"string"==typeof a}function f(){}function g(a){return!a||"loaded"==a||"complete"==a||"uninitialized"==a}function h(){var a=p.shift();q=1,a?a.t?m(function(){("c"==a.t?B.injectCss:B.injectJs)(a.s,0,a.a,a.x,a.e,1)},0):(a(),h()):q=0}function i(a,c,d,e,f,i,j){function k(b){if(!o&&g(l.readyState)&&(u.r=o=1,!q&&h(),l.onload=l.onreadystatechange=null,b)){"img"!=a&&m(function(){t.removeChild(l)},50);for(var d in y[c])y[c].hasOwnProperty(d)&&y[c][d].onload()}}var j=j||B.errorTimeout,l=b.createElement(a),o=0,r=0,u={t:d,s:c,e:f,a:i,x:j};1===y[c]&&(r=1,y[c]=[]),"object"==a?l.data=c:(l.src=c,l.type=a),l.width=l.height="0",l.onerror=l.onload=l.onreadystatechange=function(){k.call(this,r)},p.splice(e,0,u),"img"!=a&&(r||2===y[c]?(t.insertBefore(l,s?null:n),m(k,j)):y[c].push(l))}function j(a,b,c,d,f){return q=0,b=b||"j",e(a)?i("c"==b?v:u,a,b,this.i++,c,d,f):(p.splice(this.i++,0,a),1==p.length&&h()),this}function k(){var a=B;return a.loader={load:j,i:0},a}var l=b.documentElement,m=a.setTimeout,n=b.getElementsByTagName("script")[0],o={}.toString,p=[],q=0,r="MozAppearance"in l.style,s=r&&!!b.createRange().compareNode,t=s?l:n.parentNode,l=a.opera&&"[object Opera]"==o.call(a.opera),l=!!b.attachEvent&&!l,u=r?"object":l?"script":"img",v=l?"script":u,w=Array.isArray||function(a){return"[object Array]"==o.call(a)},x=[],y={},z={timeout:function(a,b){return b.length&&(a.timeout=b[0]),a}},A,B;B=function(a){function b(a){var a=a.split("!"),b=x.length,c=a.pop(),d=a.length,c={url:c,origUrl:c,prefixes:a},e,f,g;for(f=0;f<d;f++)g=a[f].split("="),(e=z[g.shift()])&&(c=e(c,g));for(f=0;f<b;f++)c=x[f](c);return c}function g(a,e,f,g,h){var i=b(a),j=i.autoCallback;i.url.split(".").pop().split("?").shift(),i.bypass||(e&&(e=d(e)?e:e[a]||e[g]||e[a.split("/").pop().split("?")[0]]),i.instead?i.instead(a,e,f,g,h):(y[i.url]?i.noexec=!0:y[i.url]=1,f.load(i.url,i.forceCSS||!i.forceJS&&"css"==i.url.split(".").pop().split("?").shift()?"c":c,i.noexec,i.attrs,i.timeout),(d(e)||d(j))&&f.load(function(){k(),e&&e(i.origUrl,h,g),j&&j(i.origUrl,h,g),y[i.url]=2})))}function h(a,b){function c(a,c){if(a){if(e(a))c||(j=function(){var a=[].slice.call(arguments);k.apply(this,a),l()}),g(a,j,b,0,h);else if(Object(a)===a)for(n in m=function(){var b=0,c;for(c in a)a.hasOwnProperty(c)&&b++;return b}(),a)a.hasOwnProperty(n)&&(!c&&!--m&&(d(j)?j=function(){var a=[].slice.call(arguments);k.apply(this,a),l()}:j[n]=function(a){return function(){var b=[].slice.call(arguments);a&&a.apply(this,b),l()}}(k[n])),g(a[n],j,b,n,h))}else!c&&l()}var h=!!a.test,i=a.load||a.both,j=a.callback||f,k=j,l=a.complete||f,m,n;c(h?a.yep:a.nope,!!i),i&&c(i)}var i,j,l=this.yepnope.loader;if(e(a))g(a,0,l,0);else if(w(a))for(i=0;i (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0];var j=d.createElement(s);var dl=l!='dataLayer'?'&l='+l:'';j.src='//www.googletagmanager.com/gtm.js?id='+i+dl;j.type='text/javascript';j.async=true;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-M677548'); Skip to main content Home About Submit ALERTS / RSS Search for this keyword Advanced Search New Results MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry View ORCID Profile Connor Meehan , Stephen Meehan , Jonathan Ebrahimian , View ORCID Profile Wayne Moore , David Parks , View ORCID Profile Guenther Walther , View ORCID Profile Leonore A. Herzenberg doi: https://doi.org/10.1101/2025.06.19.660626 Connor Meehan 1 Independent Scholar Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Connor Meehan For correspondence: connor.gw.meehan{at}gmail.com Stephen Meehan 2 Department of Genetics, Stanford University School of Medicine , Stanford, CA, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site Jonathan Ebrahimian 3 Department of Computer Science, Southern Methodist University, University Park , TX, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site Wayne Moore 2 Department of Genetics, Stanford University School of Medicine , Stanford, CA, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Wayne Moore David Parks 2 Department of Genetics, Stanford University School of Medicine , Stanford, CA, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site Guenther Walther 4 Department of Statistics, Stanford University , Stanford, CA, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Guenther Walther Leonore A. Herzenberg 2 Department of Genetics, Stanford University School of Medicine , Stanford, CA, USA Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Leonore A. Herzenberg Abstract Full Text Info/History Metrics Supplementary material Preview PDF Abstract Identifying cell populations in flow cytometry data is mostly done via a “manual gating” method that often lacks verifiability and reproducibility, even in the hands of experienced investigators. Recently developed automatic gating methods have been shown to have good performance in cell population identification, but may require fine-tuned setup from experts or struggle to identify small populations. Here, we introduce an easily trainable multilayer perceptron neural network for automatic gating (MLPgater). Compared to the three popular automatic gating methods LDA, FlowSOM and PhenoGraph on three mass and six fluorescence cytometry datasets, MLPgater is most accurate by a substantial margin, tied with LDA as the fastest and uniquely able to replace manual gating except for training purposes. Furthermore, we show that combining MLPgater with UMAP’s guided dimensionality reduction feature and DBM’s clustering (MUDflow) effectively detects new populations that did not exist or were not identified in the training set. Introduction Current flow cytometry instruments offer multi-laser measurements taken with detectors that capture entire emission spectra (“spectral” cytometers) or just a region around the peak emission of each dye (“conventional” cytometers). Mass cytometers use mass spectroscopy to measure isotope tracers as cell labels. Experiments may involve up to 50 dyes( 1 ) or 60 mass isotopes( 2 ), leading to formidable challenges in cell population identification and characterization, which is the foundation for much research discovery and many applications across numerous areas of medicine and biology. Flow informatics aims to make data analysis reproducible, interpretable and investigator-independent. The field initially focussed on the collective visual presentation of cell measurements and introduced innovative algorithms such as probability contours, compensation and bi-exponential transformations. In all cases, the goal is/was to improve the investigator’s ability to see regions of interest within X/Y scatter plots and to draw boundaries, or “gates”, to delineate highly-populated regions (populations). Outlining such regions and subregions sequentially in this manner is known as “manual gating”. Nevertheless, despite these innovations, manual gating remains imprecise, subjective and overly time-consuming( 3 , 4 ). For example, experts frequently disagree on the placement of gates within a single bivariate plot, or on which sequence of data dimensions to use in composing a gating sequence. In 2006, bioinformaticians began to pursue fully automatic gating methods (AKA classifiers) for both research and clinical usages, particularly for high-dimensional data( 5 ). As the number of measurements per cell has increased, so too has the need for at least one of these pursuits to succeed. One way to categorize these methods is as “supervised” or “unsupervised”. Supervised methods use a “training dataset” annotated with cell types in order to “learn” a classification. Unsupervised methods (often called “clustering” methods in flow cytometry) identify cell populations in cytometry data without any external information. In 2015, Malek et al.( 6 ) published such a method, named flowDensity, which outperformed state-of-the-art clustering algorithms by automatically replicating a predefined manual gating hierarchy based on assay-specific R code that processes density thresholds for every predefined gate. In 2018, Lux et al.( 7 ) claimed that their newly-released method flowLearn “works the same way as flowDensity, but does not require a practitioner to manually tune hyper-parameters for an optimized outcome”. For each assay, however, flowLearn requires an expert in biology and density statistics to create gating hierarchies expressed as density thresholds in as many samples as flowLearn deems necessary. In 2019, Abdelaal et al.( 8 ) published a supervised method using a linear discriminant analysis (LDA) classifier for mass cytometry data that achieves high F1-scores like flowLearn does but with much easier setup/training: for each assay, practitioners only input cell marker measurements and population labels from one or more representative samples. The population label can be from any prior gating that the practitioner regards as “ground truth”, manual or automatic. LDA’s setup is similar to how one trains most neural networks for classification work. In 2007, Quinn et al.( 9 ) first used neural networks with flow cytometry data for detecting cell apoptosis. In 2017, CellCNN( 10 ) used them to predict outcomes with single-cell data. Then their effectiveness as generalized gating methods for mass cytometry data was established by DeepCyTOF( 11 ) and DGCyTOF( 12 ). In 2023, Suffian et al.( 13 ) demonstrated accurate gating of conventional cytometry data with a 3-layer neural network. Here we introduce a new automatic gating method (MLPgater) based on a neural network known as a “multilayer perceptron” (MLP). To maximize the usefulness of our automatic classifier, we strived to optimize its accuracy, speed, and ease of use in classifying data from conventional, mass and spectral cytometers. In our evaluations and method comparisons, we estimated the accuracy by F1-score or central similarity (see Methods) as compared to the reference gating. We measured speed by the total runtime of the classification method. We did not directly measure ease of use, but consider this goal achieved by MLPgater in that users only need to provide sample data and population labels to enable the analysis. Manual gating is often used for new population discovery. By design, supervised methods only find known populations. On the other hand, unsupervised automatic methods are able to find both known and new populations, but infrequently use this distinction internally. For finding known populations, we can directly use the classification learned by MLPgater. Our solution for finding new populations (MUDflow) builds on the above classification as follows: the classification is used as “guidance” in a dimension reduction technique (UMAP( 14 )), after which we apply a density-based clustering method (DBM( 15 )), allowing us to identify additional populations among those previously classified as “background”. The combined result is a novel analysis pipeline that automatically delineates new populations. MUDflow’s automation has the potential to replace manual gating for all scenarios except for the annotation of a training dataset. At CYTO 2023, flow informaticians estimated( 16 ) that there were over 500 automatic methods, each of which is accurate in limited scenarios, thus echoing a conclusion of Lo et al. in 2008: “Like all clustering approaches, the methodology we have developed includes assumptions, which may limit the applicability of this approach, and it will not identify every cell population in every sample”( 17 ). Our results show that MUDflow is highly accurate for many types of datasets and for very small populations, which provides a notable improvement in the applicability of automatic methods. Methods In a flow cytometry assay, the researcher has a number N of defining cell markers (in this paper, N ranges from 8 to 43) that are used to make a measurement for each cell. Hence we can regard a flow cytometry cell measurement as a point p ϵ ℝ N The problem of cell population identification is to define a “classification”, which can be thought of as splitting ℝ N into k distinct subregions S 1 , …, S k This divides a flow cytometry dataset B into “cell populations”, each of which is a set of points lying within some subregion. For a supervised method such as MLPgater, we must also have a training dataset A and a prior classification that gives a proper example of how to classify a sample. Typically, the prior classification is derived from manual gating (see Introduction). For the method to be successful, the test set B must be compatible with A in the sense that most or all of the cell phenotypes in the test set correspond to phenotypes in the training set, the N cell marker specificities and their dye or mass labels are identical and the measurements were taken under matched conditions (e.g., with the same settings on the same flow cytometer). For situations like multi-site studies, we would hope that good standardization data from different sites and different instrument models would provide sufficiently “matched conditions”. Software and architecture choices In deep learning, the ideal choice of architecture and hyperparameters for a neural network is highly dependent on the application and must usually be found experimentally by the practitioner( 18 ). Through extensive testing, we settled on the following MLP architecture: a 5-layer fully-connected feedforward neural network with 3 hidden layers of 100, 50 and 25 neurons. Standard scaling is applied to all input data (we input z = ( x − u )/ s , where x is the observation and u and s are the mean and standard deviation, respectively, over the training set). To avoid overfitting, we use a dropout operation( 19 ) in our 100-neuron layer that randomly does not apply 25% of the updates. For activations on the hidden layers, we use the rectified linear unit (ReLU)( 20 ). For the output layer, we used softmax activation for classification( 18 ). The optimization algorithm that we use for training is programming language-dependent; for MATLAB, we use a limited-memory BFGS algorithm( 21 ); for Python, we use an Adam optimizer( 22 ). In our testing, we use both Python’s TensorFlow and MATLAB’s fitcnet. We settled on this architecture by comparing the results to those obtained using fitcnet’s optimization capability, which tests many combinations of hyperparameters and data partitions. We find that results from fitcnet, TensorFlow and this optimization of fitcnet are equivalent within the standard error of estimate. To accelerate the computations, we rewrote UMAP( 23 ) to be more suitable for tasks within our pipeline, such as guidance by MLPgater classifications. In addition, we identified default hyperparameter settings for UMAP and DBM( 15 ) that are generally effective for flow cytometry data. For UMAP, we set the “reduced dimensionality” to 2, “nearest neighbors” to 15, the metric to “Euclidean”, the “minimum distance” to 0.3, and the “spread” to 1. We use “guided UMAP” (originally named “supervised UMAP”( 24 )), which reduces the weight of an edge in UMAP’s nearest-neighbors graph if it connects data points assigned to different populations. For DBM, we follow the guidelines in the supplementary materials of Meehan et al.( 25 ) and set the “grid size” to 256, the “background scaling factor” to 4.3, and the “bandwidth” to 1.6. Our software is designed to integrate directly with FlowJo 10.x. For flow analyses already stored in FlowJo, this enables the user to import features of the data setup (e.g., scaling, compensation, etc.), data measurements and labels of population definitions (both manual and automatic). This also enables convenient exporting of population definitions from MUDflow. MUDflow classification pipeline Finding known populations Classifying known populations with MLPgater can be thought of as a two-step procedure as explained below: Using the training dataset A and pre-existing classification C A , train the neural network with architecture described in the previous section with the specified optimization algorithm. At completion, this yields a fixed network that assigns any point p ϵ ℝ n as belonging to a specific subregion, which mathematically can be expressed as a function f : ℝ N → {0, 1, 2, …, k }. Here, f ( p ) = 0 if p is considered “background” (e.g., a doublet cell, debris, or otherwise not belonging to the defined populations). Use the network to create a classification C B for the test dataset B by partitioning ℝ N so that every cell p in B lies in the subregion associated with f ( p ). The details of the neural network training in step 1 are rather complex, but the training follows a process that is fairly standard in the domain of machine learning. Each neuron in the network accepts a vector-valued input x and outputs the ReLU function max {0, w · x + c }, where the vector w and the scalar c are parameters that can be adjusted during training. The final vector output z is transformed via the softmax function (softmax( z ) i =exp( z i )/∑ j exp( z j )) and compared to the original classification C A via cross-entropy. More details can be found in most standard references on neural networks (e.g., Goodfellow et al.( 18 )). Finding new populations When using MUDflow to find new populations, we perform the following three steps in addition to the two from the previous section: 3. Perform dimensionality reduction on the test dataset B with uniform manifold approximation and projection (UMAP)( 14 ) to create a two-dimensional “embedding” E : B → ℝ 2 . Specifically, we perform “guided UMAP” using the classification C B from step 2 as the guide. 4. Use density-based merging (DBM) clustering( 15 ) directly on the dimension-reduced dataset E [ B ], which induces another classification C MUD that divides B into m clusters. Typically, m > k . 5. Use QFMatch( 26 ) to create a matching Q of populations of B defined by the classifications C B (MLPgater populations) and C MUD (clusters defined by DBM). If a cluster is not matched to any MLPgater population by Q , we denote it as a “new population”. If Q matches multiple clusters to a single MLPgater population, we denote the clusters as “new subpopulations”. Hence MUDflow, as a method, can be considered a proper extension of MLPgater. Henceforth, we will call our method “MLPgater” when we are only considering the first two steps and “MUDflow” otherwise. See Figure 1 for a schematic diagram of the entire pipeline. Download figure Open in new tab Figure 1. Overview of the MUDflow classification pipeline. 1) A fully-connected feedforward neural network (MLP) is trained with a training dataset A and a pre-existing classification C A (typically created through manual gating). 2) The network is used to create a classification C B for a new, unannotated test dataset B . 3) For new population discovery, the pipeline is continued by creating a two-dimensional representation of B using guided UMAP with C B used as the guide. 4) DBM is used to define C MUD , which labels clusters found in the UMAP plot. 5) QFMatch is used to create a matching between populations found by the neural network and clusters found by DBM in the UMAP plot. Some of the DBM clusters can then be called “new populations” and “new subpopulations”. Classifier evaluations and comparisons The inventors of both flowDensity( 6 ) and flowLearn( 7 ) demonstrated the accuracy of their methods by comparing their results to other established supervised (DeepCyTOF( 11 )) and unsupervised methods (FlowSOM( 27 ), X-Cyt( 28 ), SamSpectral( 29 ) and flowMeans( 30 )). In a similar approach, here we compare MLPgater to LDA( 8 ) (a supervised method), FlowSOM and PhenoGraph( 31 ) (unsupervised methods), which Liu et al. ranked as the three best methods overall in 2019( 32 ). Datasets description We tested our pipeline on nine published datasets, treating the reported peer-reviewed manual gating analyses as ground truth. For more details, see Table 1 and Supplementary Section S1. View this table: View inline View popup Download powerpoint Table 1. The names of nine published datasets used for testing in this paper, as well as the number of populations and defining markers (parameters) associated with each. We omitted 3 populations from the OMIP-069 study (noted with an asterisk) because they had substantial overlap with the other populations. Performance metrics Here, we use two performance metrics to gauge the success of the automatic classifiers tested. The first is F1-score, which measures population overlap via the harmonic mean of precision and recall. Since FlowCAP( 33 ), most flow informatics publications assess gating accuracy using the F1-score. Secondly, we use Central similarity (CS), which measures overlap in the central dense region of combined populations with the Jaccard index. We remove the 20% of the cells in the union of the populations that are farthest from the union’s mean using Mahalanobis distance. This definition is based on a key characteristic of phenotypes: their event measurements show a marked central tendency in all dimensions, indicating that they are “atomic”, i.e., not splittable in all tested dimensions. Testing procedures Finding known populations To evaluate the performance of the four classifiers, we run the following four-step procedure for each of the nine datasets. Prepare the data using FlowJo 10.10. We use the logicle transform to reproduce the published data scales (see Table 1 ) illustrated in the manual gating in the corresponding original paper. We use the embedded compensation matrix for conventional cytometry data (except with OMIP-058( 34 ), for which we computed it using FlowJo’s compensation wizard). Manually reproduce the published manual gating hierarchy for non-overlapping “leaf gates” (gates that have no subgates as children). Seven of 204 published leaf gates are excluded because they have many cells in common with other leaf gates. Perform automatic gating on the smallest gate containing all leaf gates, using all associated data for those parameters which define the branch’s subgates (subgate-defining parameters). Crucially, this is distinct from the procedure of Abdelaal et al. for testing LDA( 8 ), in which they discard cells that are not in leaf gates (see Supplementary Section S3). Since the membership of cells in leaf gates is not typically known a priori , we feel it is more realistic to include all cells. Run MLPgater and LDA (with their MATLAB implementations) using M -fold cross-validation, a common technique for evaluating the prediction error of a machine learning model( 35 ). The full dataset is partitioned into M similarly-sized groups of samples while leaving each biological sample fully intact within exactly one of the M groups. For each group in turn, it is used as the test set for the performance metrics, while the remaining groups act as the training set. The value of M varies by dataset (see Table 1 ). Run FlowSOM and PhenoGraph using the plugins from FlowJo 10.10. For FlowSOM, we set hyperparameters as described in Supplementary Section S2. For PhenoGraph, we use 30 for its only hyperparameter “K” (nearest neighbors). Match the unlabelled FlowSOM and PhenoGraph populations one-to-many with manually gated populations using QFMatch, which merges subsets to find the best F1-score (see Orlova et al.( 26 ), step 4 on page 5 and Figure 3 on page 6). Store automatic gates in a workspace file readable by FlowJo or other software (e.g., flowWorkspace from Bioconductor). Download figure Open in new tab Figure 3. Classifier performance relative to population size. For each of the four classifiers, a scatter plot shows the F1-score achieved by the classifier on a population vs. the population’s size on a logarithmic scale. Smaller populations tend to be harder for automatic classifiers to locate. See Supplementary Table S18 for a legend of population colors. Finding new populations We investigate the identification of new populations only for the GHOSN( 36 ) and ESHGHI( 37 ) datasets. We first prepare a special training dataset following steps 1 and 2 above. We then follow the five steps presented in the section “MUDflow classification pipeline”, using the performance metrics to evaluate the resulting classification. With the GHOSN dataset, we train MLPgater on a sample from a “RAG knockout” mouse strain that is genetically modified to not produce lymphocytes. The resulting network is used to identify populations in samples from a BALB/c mouse that has lymphocytes. With the ESHGHI dataset, we train MLPgater on a sample from which we have removed the published manual gates for eosinophils, neutrophils, basophils, plasmablasts, mDCs and pDCs. The new population data are present in the ESHGHI training as background. Thus, the GHOSN training is more representative of a real-world use case, since the new population data are genetically knocked out and thus cannot bias the training. Results Finding known populations For each of the 9 tested datasets, Figure 2 shows the F1-score distribution across populations and Table 2 shows the median and mean for the F1-score and CS. Download figure Open in new tab Figure 2. Classifier performance comparison. For each of the nine datasets and four classifiers discussed in Methods, a box-and-whisker plot shows the median and quartiles of the F1-scores for the dataset’s populations, as determined by the original publication’s manual gating. Outliers are computed with interquartile range and denoted by circles. MLPgater has the highest median score for each dataset. View this table: View inline View popup Download powerpoint Table 2. Summary values of F1-score and central similarity (CS) for each classifier and dataset. In each cell, both the median and mean (over all of the populations in each dataset) value of F1-score and CS are given. Cells are ranked by median F1-score and colored accordingly. The overall medians rank MLPgater as the best classifier, followed by LDA, PhenoGraph, and FlowSOM, respectively. MLPgater has the highest scores for F1-score and CS. Furthermore, it has the least variation between the F1-score and CS and between the medians and means, and the least variation among the datasets for the same performance metric. The CS difference between MLPgater and the other classifiers is greater than the F1-score difference in all cases except with OMIP-077( 38 ). This indicates that MLPgater is particularly sensitive and suited to the needs of phenotype classification. The accuracy of LDA, PhenoGraph and FlowSOM varies substantially between datasets even when the matched manual gates are equally plausible-looking. In contrast, MLPgater’s accuracy is more consistent and robust despite dataset differences. The F1-score and CS per population can be seen in Supplementary Section S9. Supplementary Section S6 discusses how OMIP-069’s( 39 ) lower scoring is partly due to manual gating issues specific to this publication. Population size issues The F1-scores versus population size for the four methods tested are shown in Figure 3 . Automatic methods often miss smaller populations( 40 ). MLPgater yields F1-scores of at least 0.70 in all 115 populations of six datasets, as illustrated in Figure 4 . Download figure Open in new tab Figure 4. The same scatter plots as in Figure 3 , restricted to the six of nine datasets on which MLPgater achieves no F1-scores below 0.50. See Supplementary Table S18 for a legend of population colors. In the three other datasets, 11 of 81 populations have MLPgater F1-scores less than 0.50: one in OMIP-077 (0.44), four in PANORAMA( 41 ) and six in OMIP-069. Table 3 explores the performance of classifiers on populations with the lowest F1-scores. For more details, see Supplementary Section S5. View this table: View inline View popup Download powerpoint Table 3. Difficulty with small populations. For each of the nine datasets and four classifiers discussed in Methods, the table shows the smallest F1-score achieved, the number of populations for which an F1-score of less than 0.50 was achieved, and the median frequency of these populations. As with most machine learning methods, using a larger training dataset tends to result in better performance with MLPgater. The smallest training set we used was about 125,000 cells (GHOSN dataset) on which MLPgater performed quite well (minimum F1-score of 0.77, median score of 0.95). However, in general, we recommend that the training set have size at least two times the sample size that an assay designer deems as the minimum feasible for a particular assay; larger if some populations have less than 1% frequency. Improving accuracy As discussed in step 3a of “Testing procedures”, we train with reference cell populations and analyze new cell samples by including all of the cells associated with a branch gate in the computation. In contrast, Abdelaal et al.( 8 ) train and identify using only the cells that occur in the leaves of the branch gate. Our broader testing shows that such filtering actually improves LDA’s scores more than it improves MLPgater’s (see Supplementary Tables S1 and S2). In any event, since the goal is to replace manual gating, it is unreasonable to base classifications on pregated data. FlowSOM( 27 ) and PhenoGraph( 31 ) accuracy improves when testing with many-to-many matching (instead of the one-to-many matching in step 3c of “Testing procedures”), which reveals good matches between one or more automatic populations and one or more manually gated populations (see Supplementary Tables S3 and S4). Nevertheless, because we treat scientist-reviewed manually gated populations as ground truth, we do not allow manual gates to be merged in the matching process in our normal testing procedure. The accuracy also improves on smaller subregions of a publication’s manual gating hierarchy with fewer subgate-defining parameters. For example, PhenoGraph and FlowSOM find the same populations more accurately when starting with 9 parameters at the parent gate of T cells and NKT-like cells than when starting with 26 parameters at the gate common to all OMIP-069 populations; see Supplementary Tables S7 and S8. In contrast, MLPgater’s scores are far less affected by altered starting points even when starting at the sample level which includes doublets, debris, dead cells and off-scale measurements; see Supplementary Section S7. Score improvements also occur when, for a particular classifier and dataset pairing, we add specific R/MATLAB/Python programming and statistical tuning like flowDensity requires, albeit for each and every gate. While our implementation of MLPgater allows for this, such customization conflicts with one of our three primary automation goals: ease of use. Classification speed We measured the runtime of the four classifiers on the GHOSN dataset using a computer with 6 cores and 32 GB RAM. For training the model of supervised methods, we used a training set with 126,539 cells, each with 9 parameters, from the peritoneal cavity of a BALB/c mouse (with file name “all_3-3.fcs”). Training a classifier model from this dataset requires 67 seconds for MLPgater and 0.48 seconds for LDA. Training a prior map for FlowSOM (not used in this paper) requires 17 seconds. To measure the runtime of the classification, we used a test set with 133,569 cells and 9 parameters from the peritoneal cavity of a C57BL/6 mouse (with file name “all_3-1.fcs”). The runtime was 0.11 seconds for MLPgater, 0.13 seconds for LDA, 298 seconds for PhenoGraph, and 5 seconds for FlowSOM. Training for MLPgater and LDA occurs when initially setting up an assay. Thereafter, that assay rarely requires retraining (provided the original training is truly representative), even when adding new markers for further discovery. Importantly, the computation time of LDA and MLPgater increases linearly as sample size increases. Finding new populations When run on the GHOSN dataset with mouse peritoneal cavity cells, step 3 of our method presented in “MUDflow classification pipeline” produces the embedding in two-dimensional space shown in Figure 5 . The purple curves represent the boundaries of clusters found by step 4. Download figure Open in new tab Figure 5. Guided UMAP plot of flow cytometry data from a BALB/c mouse peritoneal cavity (PerC). The classification used for guidance was generated by MLPgater trained on RAG mouse data. The BALB/c mouse sample contains lymphocytes not seen in the RAG mouse sample, leading to the large uncolored groups of data labeled “Not in training set”. The colored clusters in Figure 5 contain populations that MLPgater identified in a normal sample (BALB/c strain) from training with a sample that lacks lymphocytes (RAG strain). Using our software to highlight populations from the sample’s manual gating shows that the lymphocytes occur mostly in the uncolored clusters. The smallest population, “Developing B cells”, is 1,000 cells or 1.3% of the total cells in the new populations found. Figure 6 and Table 4 show how closely the new populations found by our method align with the manually gated populations. Download figure Open in new tab Figure 6. Guided UMAP plot from Figure 5 , after (1) running DBM clustering and (2) using QFMatch to match DBM clusters one-to-many with manually gated populations from the GHOSN publication. View this table: View inline View popup Download powerpoint Table 4. Comparison of dimension reduction techniques for finding new populations, when used in step 3 of MUDflow, in the GHOSN and ESHGHI datasets. F1-scores and CS values are reported for new populations in the datasets using our method with the specified dimension reduction technique. New populations are biologically novel in the GHOSN dataset, whereas they have been manually removed from the ESHGHI dataset. An empty cell indicates that the technique did not find the corresponding population. Missed populations are assigned a value of 0 for the purpose of median and mean calculations. Figure 6 also shows the discovery of new subpopulations of the NK, NKT population identified by MUDflow. Following the same procedure with the ESHGHI dataset, we get the F1-scores shown in Figure 7 and Table 4 . The smallest population (plasmablasts) is 400 cells. Download figure Open in new tab Figure 7. The F1-score of each new population from the ESHGHI dataset vs. the population’s size on a logarithmic scale. All 6 populations were not present in the training set for MUDflow, but found later using UMAP dimensionality reduction and DBM clustering. From a theoretical standpoint, it seems equally valid to replace guided UMAP in step 3 of our new population discovery method with another dimension reduction technique. To justify our choice, we compare guided UMAP with two other forms of dimension reduction: basic UMAP( 14 ) and PHATE( 42 ). Basic UMAP is identical to guided UMAP, except that it does not receive classification of data points and hence skips the weight-adjusting step mentioned in the section “Software and architecture choices”. Note that directly comparing basic UMAP plots of different datasets comes with difficulty; see Supplementary Section S8. PHATE is a non-linear dimension reduction technique introduced by Moon et al. in 2019 that was found to represent global and local structure well for mass cytometry data sets( 42 ). Figure 8 and Table 4 below summarize the results of our testing. New population discovery is not as good when dimension reduction is not guided by MLPgater’s known population definitions. Future research will explore this with more datasets, other dimension reduction algorithms and experimentation of the algorithms’ hyperparameters, which currently use conventional cytometry settings. Download figure Open in new tab Figure 8. Dimension reduction technique comparison. For both the GHOSN and ESHGHI datasets and each of the three dimension reduction techniques, a box-and-whisker plot shows the median and quartiles of the F1-scores for the dataset’s new populations (those not found in the training dataset), as determined by the original publication’s manual gating. Guided UMAP has the highest median score for both datasets and successfully finds each new population. Conclusions With nine very different published datasets, MLPgater is consistently the best at detecting cell populations, particularly their dense central regions. In six datasets, MLPgater scores remain high for the smallest populations, which often elude even the best automatic gating methods. For example, Eskandari et al.( 43 ) found flowDensity needed “more optimization and potentially incorporating additional tools’’ to confirm some populations containing a small number of cells. The accuracy of LDA, PhenoGraph and FlowSOM can improve substantially with manual gating additional to that needed to identify live singlets. In contrast, MLPgater performs equivalently well in the presence of dead cells, doublets, off-scale measurements and debris. Hence MLPgater is the easiest to use: simply give it all of a sample’s data and for an assay’s initial setup, also give it each cell’s population label and indicate the FCS measurement parameters (i.e. data columns) used for manual gating (or whatever method is regarded as “ground truth”). MLPgater spends little more time gating a sample than FlowJo spends copying its manual gates, regardless of sample size or number of gates. Finally, MUDflow not only detects known populations effectively, it also provides a “leg up” advantage for detecting new populations with UMAP’s guided dimensionality reduction feature and DBM clustering. Thus combining these three components creates a complete pipeline for identifying known and new cell populations (both big and small) accurately, quickly and easily in mass and fluorescence cytometry data. In the future, we will continue to explore ways to improve MUDflow’s discovery of new populations with new datasets and new tunings of the algorithms. We also intend to explore how well MUDflow can handle identifying cell populations in samples with diverse outcomes, as is quite common in the clinical setting. The Herzenberg Lab provides a software package (named “FlowJoBridge”) capable of running MUDflow free of charge at www.CytoGenie.org . To use either its GUI or API as open source in MATLAB, download it from MathWorks File Exchange( 44 ), unzip it and type “fjb” in the zip file’s root folder. This launches FlowJoBridge, which also accesses this paper’s nine datasets via “demo” FlowJo workspaces. Data availability The raw data files for all datasets used in this paper and the FlowJo Workspace files containing the manual gates used in our testing are available at the following URLs: OMIP-044: Raw data: http://flowrepository.org/id/FR-FCM-ZYC2 Gated: https://storage.googleapis.com/cytogenie.org/Samples/omip44/omip044.wsp OMIP-047: Raw data: http://flowrepository.org/id/FR-FCM-ZYFB Gated: https://storage.googleapis.com/cytogenie.org/Samples/omipB/omip047_B_cells.wsp OMIP-058: Raw data: http://flowrepository.org/id/FR-FCM-ZYRN Gated: https://storage.googleapis.com/cytogenie.org/Samples/OMIP-058/OMIP-058.wsp OMIP-069: Raw data: http://flowrepository.org/id/FR-FCM-Z2QV and http://flowrepository.org/id/FR-FCM-Z2QT Gated: https://storage.googleapis.com/cytogenie.org/Samples/OMIP40Color/OMIP-069_v2.wsp OMIP-077: Raw data: http://flowrepository.org/id/FR-FCM-Z3HC Gated: https://storage.googleapis.com/cytogenie.org/Samples/OMIP-077/OMIP-077-3WAM.wsp ESHGHI: Raw data: http://flowrepository.org/id/FR-FCM-Z24F Gated: https://storage.googleapis.com/cytogenie.org/Samples/genentech/Genentech10Merged.wsp GHOSN: Raw data: https://storage.googleapis.com/cytogenie.org/GetDown2/domains/FACS/demo/bCellMacrophag%eDiscovery/all3.zip Gated: https://storage.googleapis.com/cytogenie.org/GetDown2/domains/FACS/demo/bCellMacrophag eDiscovery/ghosnMacrophagesBCells.wsp LEIPOLD: Raw data: http://flowrepository.org/id/FR-FCM-ZY3Z Gated: https://storage.googleapis.com/cytogenie.org/Samples/maecker/LEIPOLD.wsp PANORAMA: Raw data: https://storage.googleapis.com/cytogenie.org/Samples/Nikolay/non-Neutrophils.zip Gated: https://storage.googleapis.com/cytogenie.org/Samples/Nikolay/PANORAMA_v3.wsp Code availability The source code for FlowJoBridge can be downloaded from the MathWorks File Exchange at https://www.mathworks.com/matlabcentral/fileexchange/129759-flowjobridge . Author contributions C.M., S.M., J.E., W.M. and L.A.H. contributed to the study conception and design. C.M., S.M. and J.E. were responsible for the software implementation of the algorithms designed in this paper. S.M., W.M. and D.P. contributed to the data curation. C.M., S.M., W.M., D.P., G.W. and L.A.H. participated in the data analysis and interpretation. C.M., S.M. and L.A.H. drafted the article. All authors critically revised the article for important intellectual content. Additional information Supplementary information accompanies this paper. For the present reviewers, please see the submitted PDF file and other files. Competing interests The authors declare no competing interests. Acknowledgements We thank Dylan Hinson for support using FlowJo plugins. We thank Sofie Van Gassen for support with analysis and scrutiny of FlowSOM output. The authors have no funding information to disclose. Footnotes ( connor.gw.meehan{at}gmail.com ), ( stephen.walter.meehan{at}gmail.com ), ( jebrahimian{at}mail.smu.edu ), ( wmoore{at}stanford.edu ), ( drparks{at}stanford.edu ), ( gwalther{at}stanford.edu ), ( leeherz{at}stanford.edu ) References 1. ↵ Konecny AJ , Mage P , Tyznik AJ , Prlic M , Mair F . 50-color phenotyping of the human immune system with in-depth assessment of T cells and dendritic cells . BioRxiv Prepr. Serv. Biol . 2023 :2023.12.14.571745. 2. ↵ Fernández-Zapata C , Leman JKH , Priller J , Böttcher C . The use and limitations of single-cell mass cytometry for studying human microglia function . Brain Pathol. Zurich Switz . 2020 ; 30 : 1178 – 1191 . OpenUrl CrossRef 3. ↵ Grant R , Coopman K , Medcalf N , Silva-Gomes S , Campbell JJ , Kara B , Braybrook J , Petzing J . Understanding the contribution of operator measurement variability within Flow Cytometry data analysis for Quality Control of Cell and Gene Therapy manufacturing . Measurement 2020 ; 150 : 106998 . OpenUrl CrossRef 4. ↵ Grant R , Coopman K , Medcalf N , Silva-Gomes S , Campbell JJ , Kara B , Braybrook J , Petzing J . Quantifying Operator Subjectivity within Flow Cytometry Data Analysis as a Source of Measurement Uncertainty and the Impact of Experience on Results . PDA J. Pharm. Sci. Technol . 2021 ; 75 : 33 – 47 . OpenUrl Abstract / FREE Full Text 5. ↵ Brinkman RR , Gasparetto M , Lee S-JJ , Ribickas AJ , Perkins J , Janssen W , Smiley R , Smith C . High-Content Flow Cytometry and Temporal Data Analysis for Defining a Cellular Signature of Graft-Versus-Host Disease . Biol. Blood Marrow Transplant . 2007 ; 13 : 691 – 700 . OpenUrl CrossRef PubMed Web of Science 6. ↵ Malek M , Taghiyar MJ , Chong L , Finak G , Gottardo R , Brinkman RR . flowDensity: reproducing manual gating of flow cytometry data by automated density-based cell population identification . Bioinformatics 2015 ; 31 : 606 – 607 . OpenUrl CrossRef PubMed 7. ↵ Lux M , Brinkman RR , Chauve C , Laing A , Lorenc A , Abeler-Dörner L , Hammer B . flowLearn: fast and precise identification and quality checking of cell populations in flow cytometry . Bioinformatics 2018 ; 34 : 2245 – 2253 . OpenUrl CrossRef PubMed 8. ↵ Abdelaal T , van Unen V , Höllt T , Koning F , Reinders MJT , Mahfouz A . Predicting Cell Populations in Single Cell Mass Cytometry Data . Cytometry A 2019 ; 95 : 769 – 781 . OpenUrl CrossRef PubMed 9. ↵ Quinn J , Fisher PW , Capocasale RJ , Achuthanandam R , Kam M , Bugelski PJ , Hrebien L . A statistical pattern recognition approach for determining cellular viability and lineage phenotype in cultured cells and murine bone marrow . Cytometry A 2007 ; 71A : 612 – 624 . OpenUrl PubMed 10. ↵ Arvaniti E , Claassen M . Sensitive detection of rare disease-associated cell subsets via representation learning . Nat. Commun . 2017 ; 8 : 14825 . OpenUrl CrossRef PubMed 11. ↵ Li H , Shaham U , Stanton KP , Yao Y , Montgomery RR , Kluger Y . Gating mass cytometry data by deep learning . Bioinformatics 2017 ; 33 : 3423 – 3430 . OpenUrl CrossRef PubMed 12. ↵ Cheng L , Karkhanis P , Gokbag B , Liu Y , Li L . DGCyTOF: Deep learning with graphic cluster visualization to predict cell types of single cell mass cytometry data . PLOS Comput. Biol . 2022 ; 18 : e1008885 . OpenUrl CrossRef PubMed 13. ↵ Suffian M , Montagna S , Bogliolo A , Ortolani C , Papa S , D’Atri M. Machine learning for automated gating of flow cytometry data . In: Calimeri F , Dragoni M , Stella F , editors 1st AIxIA Workshop Artif. Intell. Healthc. HCAIxIA 2022 . Vol 3307 . CEUR Workshop Proceedings . Udine, Italy : CEUR ; 2022 . p 47 – 56 . Available at: https://ceur-ws.org/Vol-3307/#paper5 . Accessed March 26, 2024 . OpenUrl 14. ↵ McInnes L , Healy J , Melville J . UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction . 2020 . Available at: http://arxiv.org/abs/1802.03426 . Accessed March 26, 2024 . 15. ↵ Walther G , Zimmerman N , Moore W , Parks D , Meehan S , Belitskaya I , Pan J , Herzenberg L . Automatic Clustering of Flow Cytometry Data with Density-Based Merging . Adv. Bioinforma . 2009 ;2009: e686759 . 16. ↵ Novo D. Get out of your cluster funk: overview of clustering algorithms for biology . 2023 . Available at: https://web.archive.org/web/20230513193423/https://www.cytoconference.org/program.html . Accessed March 26, 2024 . 17. ↵ Lo K , Brinkman RR , Gottardo R . Automated gating of flow cytometry data via robust model-based clustering . Cytometry A 2008 ; 73A : 321 – 332 . OpenUrl CrossRef PubMed 18. ↵ Goodfellow I , Bengio Y , Courville A. Deep Learning . Cambridge, Massachusetts : The MIT Press ; 2016 . 775 p. 19. ↵ Srivastava N , Hinton G , Krizhevsky A , Sutskever I , Salakhutdinov R . Dropout: A Simple Way to Prevent Neural Networks from Overfitting . J. Mach. Learn. Res . 2014 ; 15 : 1929 – 1958 . OpenUrl CrossRef 20. ↵ Jarrett K , Kavukcuoglu K , Ranzato M , LeCun Y. What is the best multi-stage architecture for object recognition? 2009 IEEE 12th Int. Conf. Comput. Vis. ICCV 2009 2009 : 2146 – 2153 . 21. ↵ Liu DC , Nocedal J . On the limited memory BFGS method for large scale optimization . Math. Program . 1989 ; 45 : 503 – 528 . OpenUrl CrossRef 22. ↵ Kingma DP , Ba J. Adam: A Method for Stochastic Optimization . 2017 . Available at: http://arxiv.org/abs/1412.6980 . Accessed April 18, 2024 . 23. ↵ Meehan C , Ebrahimian J , Moore W , Meehan S. Uniform Manifold Approximation and Projection (UMAP) . 2023 . Available at: https://www.mathworks.com/matlabcentral/fileexchange/71902-uniform-manifold-approximation-and-projection-umap . Accessed March 26, 2024 . 24. ↵ McInnes L. UMAP for Supervised Dimension Reduction and Metric Learning — umap 0.5 documentation . 2018 . Available at: https://umap-learn.readthedocs.io/en/latest/supervised.html . Accessed March 26, 2024 . 25. ↵ Meehan S , Kolyagin GA , Parks D , Youngyunpipatkul J , Herzenberg LA , Walther G , Ghosn EEB , Orlova DY . Automated subset identification and characterization pipeline for multidimensional flow and mass cytometry data clustering and visualization. Commun . Biol . 2019 ; 2 : 229 . OpenUrl 26. ↵ Orlova DY , Meehan S , Parks D , Moore WA , Meehan C , Zhao Q , Ghosn EEB , Herzenberg LA , Walther G . QFMatch: multidimensional flow and mass cytometry samples alignment . Sci. Rep . 2018 ; 8 : 3291 . OpenUrl CrossRef PubMed 27. ↵ Van Gassen S , Callebaut B , Van Helden MJ , Lambrecht BN , Demeester P , Dhaene T , Saeys Y . FlowSOM: Using self-organizing maps for visualization and interpretation of cytometry data . Cytometry A 2015 ; 87 : 636 – 645 . OpenUrl CrossRef PubMed 28. ↵ Hu X , Kim H , Brennan PJ , Han B , Baecher-Allan CM , De Jager PL , Brenner MB , Raychaudhuri S . Application of user-guided automated cytometric data analysis to large-scale immunoprofiling of invariant natural killer T cells . Proc. Natl. Acad. Sci . 2013 ; 110 : 19030 – 19035 . OpenUrl Abstract / FREE Full Text 29. ↵ Zare H , Shooshtari P , Gupta A , Brinkman RR . Data reduction for spectral clustering to analyze high throughput flow cytometry data . BMC Bioinformatics 2010 ; 11 : 403 . OpenUrl CrossRef PubMed 30. ↵ Aghaeepour N , Nikolic R , Hoos HH , Brinkman RR . Rapid cell population identification in flow cytometry data . Cytom. Part J. Int. Soc. Anal. Cytol . 2011 ; 79 : 6 – 13 . OpenUrl 31. ↵ Levine JH , Simonds EF , Bendall SC , Davis KL , Amir ED , Tadmor MD , Litvin O , Fienberg HG , Jager A , Zunder ER , Finck R , Gedman AL , Radtke I , Downing JR , Pe’er D , Nolan GP . Data-Driven Phenotypic Dissection of AML Reveals Progenitor-like Cells that Correlate with Prognosis . Cell 2015 ; 162 : 184 – 197 . OpenUrl CrossRef PubMed 32. ↵ Liu X , Song W , Wong BY , Zhang T , Yu S , Lin GN , Ding X . A comparison framework and guideline of clustering methods for mass cytometry data . Genome Biol . 2019 ; 20 : 297 . OpenUrl CrossRef PubMed 33. ↵ Aghaeepour N , Finak G , Hoos H , Mosmann TR , Brinkman R , Gottardo R , Scheuermann RH . Critical assessment of automated flow cytometry data analysis techniques . Nat. Methods 2013 ; 10 : 228 – 238 . OpenUrl CrossRef PubMed Web of Science 34. ↵ Liechti T , Roederer M . OMIP-058: 30-Parameter Flow Cytometry Panel to Characterize iNKT, NK, Unconventional and Conventional T Cells . Cytometry A 2019 ; 95 : 946 – 951 . OpenUrl CrossRef PubMed 35. ↵ Hastie T , Tibshirani R , Friedman JH . The elements of statistical learning: data mining, inference, and prediction . Second edition, corrected at 12th printing 2017. New York, NY : Springer ; 2017 . 745 p. 36. ↵ Ghosn EEB , Cassado AA , Govoni GR , Fukuhara T , Yang Y , Monack DM , Bortoluci KR , Almeida SR , Herzenberg LA , Herzenberg LA . Two physically, functionally, and developmentally distinct peritoneal macrophage subsets . Proc. Natl. Acad. Sci. U. S. A . 2010 ; 107 : 2568 – 2573 . OpenUrl Abstract / FREE Full Text 37. ↵ Toghi Eshghi S , Au-Yeung A , Takahashi C , Bolen CR , Nyachienga MN , Lear SP , Green C , Mathews WR , O’Gorman WE . Quantitative Comparison of Conventional and t-SNE-guided Gating Analyses . Front. Immunol . 2019 ; 10 . Available at: https://www.frontiersin.org/journals/immunology/articles/10.3389/fimmu.2019.01194/full . Accessed March 26, 2024 . 38. ↵ Boesch M , Sykora M , Gasteiger S , Baty F , Brutsche MH , Sopper S . OMIP 077: Definition of all principal human leukocyte populations using a broadly applicable 14-color panel . Cytometry A 2022 ; 101 : 15 – 20 . OpenUrl CrossRef PubMed 39. ↵ Park LM , Lannigan J , Jaimes MC . OMIP-069: Forty-Color Full Spectrum Flow Cytometry Panel for Deep Immunophenotyping of Major Cell Subsets in Human Peripheral Blood . Cytometry A 2020 ; 97 : 1044 – 1051 . OpenUrl CrossRef PubMed 40. ↵ Conrad VK , Dubay CJ , Malek M , Brinkman RR , Koguchi Y , Redmond WL . Implementation and Validation of an Automated Flow Cytometry Analysis Pipeline for Human Immune Profiling . Cytometry A 2019 ; 95 : 183 – 191 . OpenUrl CrossRef PubMed 41. ↵ Samusik N , Good Z , Spitzer MH , Davis KL , Nolan GP . Automated mapping of phenotype space with single-cell data . Nat. Methods 2016 ; 13 : 493 – 496 . OpenUrl CrossRef PubMed 42. ↵ Moon KR , van Dijk D , Wang Z , Gigante S , Burkhardt DB , Chen WS , Yim K , Elzen A van den , Hirn MJ , Coifman RR , Ivanova NB , Wolf G , Krishnaswamy S. Visualizing structure and transitions in high-dimensional biological data . Nat. Biotechnol . 2019 ; 37 : 1482 – 1492 . OpenUrl CrossRef PubMed 43. ↵ Eskandari G , Subedi S , Christensen P , Olsen RJ , Zu Y , Long SW . Implementing flowDensity for Automated Analysis of Bone Marrow Lymphocyte Population . J. Pathol. Inform . 2021 ; 12 : 49 . OpenUrl CrossRef PubMed 44. ↵ Meehan C , Meehan S , Moore W , Herzenberg L. FlowJoBridge . 2023 . Available at: https://www.mathworks.com/matlabcentral/fileexchange/129759-flowjobridge . Accessed March 26, 2024 . 45. Mair F , Prlic M . OMIP-044: 28-color immunophenotyping of the human dendritic cell compartment . Cytometry A 2018 ; 93 : 402 – 405 . OpenUrl CrossRef PubMed 46. Liechti T , Günthard HF , Trkola A . OMIP-047: High-Dimensional phenotypic characterization of B cells . Cytometry A 2018 ; 93 : 592 – 596 . OpenUrl CrossRef PubMed 47. Leipold MD , Obermoser G , Fenwick C , Kleinstuber K , Rashidi N , McNevin JP , Nau AN , Wagar LE , Rozot V , Davis MM , DeRosa S , Pantaleo G , Scriba TJ , Walker BD , Olsen LR , Maecker HT . Comparison of CyTOF assays across sites: Results of a six-center pilot study . J. Immunol. Methods 2018 ; 453 : 37 – 43 . OpenUrl CrossRef PubMed View the discussion thread. Back to top Previous Next Posted June 25, 2025. Download PDF Supplementary Material Email Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. You are going to email the following MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website. Your Personal Message CAPTCHA This question is for testing whether or not you are a human visitor and to prevent automated spam submissions. Share MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry Connor Meehan , Stephen Meehan , Jonathan Ebrahimian , Wayne Moore , David Parks , Guenther Walther , Leonore A. Herzenberg bioRxiv 2025.06.19.660626; doi: https://doi.org/10.1101/2025.06.19.660626 Share This Article: Copy Citation Tools MUDflow: Combining Neural Networks, UMAP and DBM Clustering to Identify Cell Populations Accurately, Quickly and Easily in Mass and Fluorescence Cytometry Connor Meehan , Stephen Meehan , Jonathan Ebrahimian , Wayne Moore , David Parks , Guenther Walther , Leonore A. Herzenberg bioRxiv 2025.06.19.660626; doi: https://doi.org/10.1101/2025.06.19.660626 Citation Manager Formats BibTeX Bookends EasyBib EndNote (tagged) EndNote 8 (xml) Medlars Mendeley Papers RefWorks Tagged Ref Manager RIS Zotero Tweet Widget Facebook Like Google Plus One Subject Area Bioinformatics Subject Areas All Articles Animal Behavior and Cognition (7633) Biochemistry (17681) Bioengineering (13890) Bioinformatics (41929) Biophysics (21446) Cancer Biology (18586) Cell Biology (25492) Clinical Trials (138) Developmental Biology (13374) Ecology (19897) Epidemiology (2067) Evolutionary Biology (24308) Genetics (15606) Genomics (22497) Immunology (17736) Microbiology (40385) Molecular Biology (17175) Neuroscience (88584) Paleontology (666) Pathology (2831) Pharmacology and Toxicology (4822) Physiology (7641) Plant Biology (15149) Scientific Communication and Education (2045) Synthetic Biology (4293) Systems Biology (9822) Zoology (2271)

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00