 Methodology article
 Open Access
 Published:
Slingshot: cell lineage and pseudotime inference for singlecell transcriptomics
BMC Genomics volume 19, Article number: 477 (2018)
Abstract
Background
Singlecell transcriptomics allows researchers to investigate complex communities of heterogeneous cells. It can be applied to stem cells and their descendants in order to chart the progression from multipotent progenitors to fully differentiated cells. While a variety of statistical and computational methods have been proposed for inferring cell lineages, the problem of accurately characterizing multiple branching lineages remains difficult to solve.
Results
We introduce Slingshot, a novel method for inferring cell lineages and pseudotimes from singlecell gene expression data. In previously published datasets, Slingshot correctly identifies the biological signal for one to three branching trajectories. Additionally, our simulation study shows that Slingshot infers more accurate pseudotimes than other leading methods.
Conclusions
Slingshot is a uniquely robust and flexible tool which combines the highly stable techniques necessary for noisy singlecell data with the ability to identify multiple trajectories. Accurate lineage inference is a critical step in the identification of dynamic temporal gene expression.
Background
Traditional transcription assays, such as bulk microarrays and RNA sequencing (RNASeq), offer a bird’seye view of transcription. However, as they rely on RNA from a large number of cells as starting material, they are not ideal for examining heterogeneous populations of cells. Newlydeveloped singlecell assays can give us a much more detailed picture [1]. This higher resolution allows researchers to distinguish between closelyrelated populations of cells, potentially revealing functionally distinct groups with complex relationships [2].
For many systems, there are not clear distinctions between cellular states, but instead a smooth transition, where individual cells represent points along a continuum or lineage. Cells in these systems change states by undergoing gradual transcriptional changes, with progress being driven by an underlying temporal variable or pseudotime. For example, [3] examined the differentiation pattern of skeletal myoblasts, showing that their development into myocytes and mature myotubes follows a continuous lineage, rather than discrete steps. Inference of lineage structure has been referred to as pseudotemporal reconstruction and it can help us understand how cells change state and how cell fate decisions are made [3–5]. Furthermore, many systems contain multiple lineages that share a common initial state but branch and terminate at different states. These complex lineage structures require additional analysis to distinguish between cells that fall along different lineages [6–10].
Several methods have been proposed for the task of pseudotemporal reconstruction, each with their own set of strengths and assumptions. We describe a few popular approaches here; for a thorough review see [11, 12]. One of the most wellknown methods is Monocle [3], which constructs a minimum spanning tree (MST) on cells in a reduceddimensionality space created by independent component analysis (ICA) and orders cells via a PQ tree along the longest path through this tree. The direction of this path and the number of branching events are left to the user, who may examine a known set of marker genes or use time of sample collection as indications of initial and terminal cell states. The more recent Monocle 2 [8] uses a different approach, with dimensionality reduction and ordering performed by reverse graph embedding (RGE), allowing it to detect branching events in an unsupervised manner. The methods Waterfall [10] and TSCAN [7] instead determine the lineage structure by clustering cells in a lowdimensional space and drawing an MST on the cluster centers. Lineages are represented by piecewise linear paths through the tree, providing an intuitive, unsupervised method for identifying branching events. Pseudotimes are calculated by orthogonal projection onto these paths, with the identification of the direction and of the cluster of origin again left to the user. Other approaches use smooth curves to represent development, but are naturally limited to nonbranching lineages. For example, Embeddr [5] uses the principal curves method of [13] to infer lineages in a lowdimensional space obtained by a Laplacian eigenmap [14]. Yet another class of methods uses robust celltocell distances and a prespecified starting cell to determine pseudotime. For instance, diffusion pseudotime (DPT) [6] uses a weighted k nearest neighbors (kNN) graph on cells and calculates distances using transition probabilities over random walks of arbitrary length. Similarly, Wishbone [9], an extension of Wanderlust [4], uses an ensemble of kNN graphs on cells along with a randomly selected group of waypoints to iteratively refine stable distance estimates. Finally, other methods take a modelbased approach to detecting branching events. GPfates [15] uses a Gaussian process latent variable model (GPLVM) and overlapping mixtures of Gaussian processes (OMGP) to infer trajectories and pseudotimes. A similar method, DeLorean [16], uses a single GPLVM to infer pseudotimes along a single trajectory. And the mixtures of factor analysers (MFA) method [17] takes a hierarchical Bayesian approach, using Markov chain MonteCarlo (MCMC) to sample from the posterior of a fully generative model that includes branch identities. See Table 1 for a summary of existing methods.
Here, we introduce Slingshot, a novel lineage inference tool designed for multiple branching lineages. Slingshot combines highly stable techniques necessary for noisy singlecell data with the flexibility to identify multiple lineages with varying levels of supervision. Slingshot consists of two main stages: 1) the inference of the global lineage structure and 2) the inference of pseudotime variables for cells along each lineage (Fig. 1). Like other methods [7, 10], Slingshot’s first stage uses a clusterbased MST to stably identify the key elements of the global lineage structure, i.e., the number of lineages and where they branch (Fig. 1, Step 1). This allows us to identify novel lineages while also accommodating the use of domainspecific knowledge to supervise parts of the tree (e.g., terminal cellular states). For the second stage, we propose a novel method called simultaneous principal curves, to fit smooth branching curves to these lineages, thereby translating the knowledge of global lineage structure into stable estimates of the underlying celllevel pseudotime variable for each lineage (Fig. 1, Step 2). The Slingshot method is implemented in the opensource R package slingshot (available from the GitHub repository https://github.com/kstreet13/slingshot) to be released through the Bioconductor Project (http://www.bioconductor.org).
In addition to Slingshot’s core methodological components described above for lineage and pseudotime inference, we note the importance of upstream analysis choices. Indeed, most pseudotemporal reconstruction methods will either explicitly or implicitly require certain choices at previous steps in the workflow. Dimensionality reduction, for example, helps in reducing the amount of noise in the data and in visualization, but a variety of approaches are available, with a potentially large impact on the final result (Additional file 1: Figure S7). Monocle recommends ICA or DDRTree, Waterfall and TSCAN use principal component analysis (PCA), Embedder uses Laplacian eigenmaps [14], and Wishbone uses diffusion maps for analysis and tdistributed stochastic neighbor embedding (tSNE) [18] for visualization (Table 1). Given the great diversity of data being generated by singlecell assays, it seems unlikely that there is a onesizefitsall solution to the dimensionality reduction problem; likewise for normalization and clustering. These analysis steps are very important and because different lineage inference methods make different upstream choices, they can be difficult to compare. Slingshot does not specify these upstream methods, but is instead designed with flexibility and modularity in mind, to easily integrate with the normalization, dimensionality reduction, and clustering methods deemed most appropriate for a particular dataset. Our recommended singlecell RNASeq data analysis workflow, implemented in Bioconductor R packages, is described in [19]: the pipeline includes the dataadaptive selection of a normalization procedure (scone package; [20]), dimensionality reduction using a zeroinflated negative binomial model (zinbwave package; [21]), and resamplingbased sequential ensemble clustering (RSEC; clusterExperiment package; [22]).
Results and discussion
Slingshot divides the problem of multiple lineage inference into two stages:

1. Identification of lineages, i.e., ordered sets of cell clusters, where all lineages share a starting cluster and each leads to a unique terminal cluster. This is achieved by constructing an MST on clusters of cells.

2. For each lineage, identification of pseudotimes, i.e., a onedimensional variable representing each cell’s transcriptional progression toward the terminal state. This is achieved by a method which extends principal curves [13] to the case of multiple branching lineages.
One of the main challenges of singlecell RNASeq data analysis is the high level of variability. In addition to the host of biological and technical sources of variation that can affect any (bulk) RNASeq experiment, singlecell data may contain effects from transcriptional bursting [23, 24] and dropout [25]. We therefore believe that robustness to noise, unwanted technical effects, and preprocessing are important characteristics of a lineage inference method. Slingshot provides the flexibility to capture complex lineage structures along with the stability needed for working with noisy singlecell data.
Real datasets
Robustness to noise. We first examined the stability of a few wellknown methods using a subset of the human skeletal muscle myoblasts (HSMM) dataset of [3] comprising a single lineage. In Fig. 2, we illustrate each method’s ordering of the full set of 212 cells and show how consistently it orders cells over 50 subsamples (bootstrap samples with duplicates removed). The Monocle procedure, which constructs an MST on individual cells and orders them according to a PQ tree along the longest path of the MST, was the least stable of the methods we compared. The path drawn by Monocle was highly variable and sensitive to even small amounts of noise; this instability has been previously discussed in [7]. In contrast, other methods which emphasize stability in the construction of their primary trajectory and obtain pseudotime values based on orthogonal projection produced much more stable orderings.
Both the clusterbased MST method [7, 10] and the principal curve method [5, 13] demonstrated stability over the bootstraplike samples shown in Fig. 2b. However, due to the vertices of the piecewise linear path drawn by the clusterbased MST, multiple cells will often be assigned identical pseudotimes, corresponding to the value at the vertex. The principal curve approach was the most stable method, but on more complex datasets, it has the obvious limitation of only characterizing a single lineage. It is for this reason that we chose to extend principal curves to accommodate multiple branching lineages.
Multiple lineage inference. One of the biggest challenges in lineage inference is determining the number and location of branching events. Some methods introduce simplifying assumptions or restrictions on discovery; for example, requiring the user to prespecify the number of lineages or limiting the model space to only one or two. Slingshot allows for multiple lineage detection without prespecifying or limiting the number of lineages. Instead, Slingshot provides a framework for optional incorporation of localized prior biological knowledge that does not restrict other parts of the tree or introduce global specifications. As with the specification of an initial cluster, users may specify a certain number of terminal clusters, which will be restricted to a single edge in the clusterbased MST.
This local supervision was used in the analysis of the olfactory epithelium (OE) data of [26] to mark mature sustentacular (mSus) cells, microvillous (MV) cells, and mature olfactory sensory neurons (mOSN) as terminal states, though only the first had an effect on the eventual clusterbased MST. Slingshot’s resulting lineage structure established the order of the two bifurcations, which was later validated. Specifically, it was demonstrated that sustentacular cells are produced via direct conversion of horizontal basal cells (HBC), whereas microvillous and neuronal cells require an intermediate, proliferative state (see Fig. 3a for a summary of validated relationships between cell types).
We also note that the OE lineage structure could not have been recovered using standard Euclidean distances between cluster centers (Additional file 1: Figure S1c), as in Waterfall and TSCAN. By failing to utilize the shapes of the clusters, the standard Euclidean distance identified a spurious branching event very early on in HBC differentiation. Slingshot allows the use of a shapesensitive distance measure inspired by the Mahalanobis distance [27], which scales the distance between cluster centers based on the covariance structure of the two clusters.
While Slingshot identified lineages consistent with prior biological knowledge, other lineage detection methods did not. Monocle 2 only identified two lineages, one of which terminates in globose basal cells (GBC), a known transition state, and both of which contain sustentacular cells and microvillous cells, known endpoints of separate lineages (Fig. 3). TSCAN also produced only two lineages with similar issues (Additional file 1: Figure S3f). Given the proper number of lineages, Monocle also misidentified GBCs as a terminal state, but correctly identified lineages terminating in mOSNs and mSus cells (Additional file 1: Figure S3e). Diffusion pseudotime identified these endpoints as well, but it additionally found several spurious lineages (nine in total, Additional file 1: Figure S3j). Finally, Wishbone is limited in implementation to only two lineages, but even when we restricted the analysis to only the sustentacular and neuronal lineages (as identified by Slingshot), it still failed to accurately characterize this single branching event (Additional file 1: Figure S4c).
In Additional file 1: Figure S2, we show that, in addition to capturing complex multilineage structures, Slingshot is also able to correctly detect a single lineage and two bifurcating lineages, respectively, in the datasets of [3, 10]. In both cases, Slingshot’s final pseudotime variables are highly correlated with those found in the original publications, but do not rely on user specification of the number of lineages nor on subsetting the data, as in the case of Waterfall.
Simulation study
Design. In order to make a more quantitative comparison of different lineage inference methods and examine Slingshot’s robustness to upstream computational choices, we conducted a simulation study with synthetic datasets generated using the Bioconductor R package splatter [28]. In the first part of the study, all simulated datasets sconsisted of an initial path that bifurcates into two distinct lineages (Fig. 4a). In the second part of the study, each dataset was simulated from a more complex branching structure, with five distinct lineages (Fig. 4b). For the twolineage portion of the simulation study, 1200 synthetic datasets were generated and for the fivelineage portion, 300 datasets were simulated. The number of cells in the datasets and the signaltonoise ratio were varied; parameters defining the marginal distributions of the expression measures for both genes and samples were learned from the dataset of [3] (see Additional file 1: Figure S6 for parameter values used by splatter). Transcriptlevel counts were obtained from the conquer repository [29] and aggregated into genelevel counts. Unless otherwise noted, datasets were fullquantilenormalized prior to lineage inference. See “Methods” section for complete details.
The accuracy of inferred pseudotimes was measured as follows: for each true lineage, identify the best match amongst all inferred lineages, according to the Kendall rank correlation coefficient between the true and inferred pseudotime variables. Averaging these values over all true lineages yields the accuracy score for a particular method on a particular dataset. As with the standard Pearson correlation coefficient, the Kendall rank correlation coefficient achieves values between 1 and 1, with values closer to one indicating better agreement between the inferred and true pseudotimes.
Slingshot was applied with various upstream dimensionality reduction and clustering techniques, allowing us to assess their impact on the accuracy of the resulting pseudotime variables. Existing lineage inference methods were also applied to each dataset in order to compare their performance. For each of these existing methods, multiple strategies were implemented and the bestperforming strategy was selected as the representative of that method. We then compared these bestcase runs to a similar implementation of Slingshot, matched for dimensionality reduction and clustering, when possible.
Monocle and Monocle 2 were implemented using a range of values for J^{′}, the size of the reduceddimensional space, and two techniques for selecting genes. The first, suggested in the Monocle vignette, used genes with the 100 highest loadings along the top J^{′} principal components. The second selected genes with either the 5000 highest means or variances of logcounts; this is comparable to using all the genes, but less computationally burdensome, as Monocle and Monocle 2 tended to be the slowest of the methods we examined (other methods used the full set of genes). Since it cannot detect branching, Monocle was always given the correct number of lineages. TSCAN was implemented both with and without the recommended preprocessing step and with this step in place of fullquantile normalization. Additionally, we present results from a hybrid method which uses TSCAN for dimensionality reduction and clustering before using Slingshot for pseudotime inference, in order to study the combined impact of replacing Euclidean distances by covarianceweighted distances for the clusterbased MST and piecewise linear paths by simultaneous principal curves. Diffusion pseudotime (DPT) was implemented with default parameter values, but multiple strategies had to be implemented in order to account for variable amounts of missing information in the results. The “DPTFull” strategy uses every branching event reported, often resulting in cells being dropped due to missing branch information. Other strategies, such as “DPT2”, “DPT3”, etc., use only the highestlevel branching events, producing the specified number of lineages, with “DPT1” ignoring branching events altogether. For additional details on how these methods were implemented, see the Simulation Study Design and Results section in Additional file 1 of the Supplementary Information. Finally, we note that the bifurcation events present in datasets generated by splatter are “sharp” rather than curved (see Additional file 1: Figure S7), which may disadvantage methods that assume smoothness, such as Slingshot and DPT.
Comparison of methods. In the twolineage case, most of the Monocle strategies performed well, often producing a bimodal distribution of accuracy scores with one peak around 0 and a larger peak at or above 0.5 (Additional file 1: Figure S10). However, Monocle also returned an error more often than any other method and these errors seem to be associated with larger sample sizes (Additional file 1: Figure S11). We also note that Monocle was always provided the correct number of lineages, which most other methods were not. Among the strategies we implemented, the highest median accuracy score was achieved with the larger gene set (selected by the highest 5000 means and variances), with twodimensional ICA. We therefore compared these results to Slingshot accuracy scores using twodimensional ICA and clustering by Gaussian mixture modeling (GMM) in Fig. 4b. Slingshot’s distribution of accuracy scores was similarly bimodal, but with both peaks shifted slightly higher.
Compared to Monocle, Monocle 2 was more consistent, but less accurate overall. It rarely returned scores close to 0 and showed considerably less bimodality, especially with four or fivedimensional RGE (Additional file 1: Figure S10). The lower overall accuracy scores may be due, in part, to the large number of spurious branching events it identified; in the synthetic datasets with two lineages, Monocle 2 identified four or more lineages 80.3% of the time. Unlike other methods, increasing the number of cells in the dataset did not improve the performance of Monocle 2, but actually resulted in even more spurious lineages being found. For datasets of more than 360 cells, Monocle 2 failed to find the correct number of lineages in any simulation, sometimes finding as many as 16 (Additional file 1: Figure S14). As the highest median accuracy score for Monocle 2 was also produced with the larger gene set and J^{′}=2, we compare it to the same set of Slingshot results in Fig. 4b.
As discussed previously, Diffusion Pseudotime suffered from a considerable proportion of cells with missing branch assignments, leading to artificially low accuracy scores. In both the two and fivelineage cases, the highest median accuracy score was achieved by the DPT1 strategy, which did not make use of the branching information. We examined this issue in the twolineage case, looking at the highestlevel branching event, which should theoretically divide the cells into three groups: one prior to the branching event and two after it. On average, 44.1% of cells were not assigned a group. There was no noticeable relationship between this percentage and sample size, but the percentage of unassigned cells did decrease modestly with increased signal in the data. We compared DPT results to Slingshot results with eightdimensional diffusion maps (the highest dimensionality we implemented) and Gaussian mixture modeling in both Figs. 4b and d.
TSCAN with fullquantile normalization produced accuracy scores comparable to Monocle 2. When run with the recommended preprocessing step, TSCAN did slightly worse, particularly in the absence of fullquantile normalization. The highest median accuracy score was produced by the hybrid method with Slingshot, which used fullquantile normalization with no additional preprocessing. For a more complete comparison, Fig. 4b also shows the best “pure” TSCAN strategy and Slingshot results with threedimensional PCA and GMM clustering. We also note that our comparison may be slightly unfavorable for TSCAN, because it has builtin methods for selecting both J^{′} (the reduced number of dimensions) and K (the number of clusters). This userfriendliness unfortunately means that there are fewer parameters over which we could try different strategies, hence our implementations without fullquantile normalization and as part of a hybrid method with Slingshot. For complete results of all strategies implemented on the twolineage datasets, see Additional file 1: Figure S10.
In the second part of the simulation study, the more complex fivelineage structure led to lower scores for most methods, with the notable exception of TSCAN, which produced a marginally higher median accuracy score than in the twolineage case (Fig. 4d). The methods which do not make use of a clusterbased MST had the poorest performance in this setting, while TSCAN and Slingshot fared slightly better. We compared the TSCAN results to those of the hybrid method and Slingshot with 4dimensional PCA and GMM. Again, the best strategies for Monocle and Monocle 2 made use of the larger gene sets, this time with 4dimensional ICA and 5dimensional RGE, respectively. We compared this to Slingshot results using 4dimensional ICA and GMM. Monocle 2 continued to identify a large number of spurious lineages and there was still strong correlation between sample size and the number of lineages it inferred. For complete results of all strategies implemented on the fivelineage datasets, see Additional file 1: Figure S12.
Unlike the twolineage case, the fivelineage topology is asymmetric, meaning that some lineages were harder to characterize than others. Nonetheless, Slingshot and TSCAN still generally outperformed other methods across all lineage types; for a full breakdown of all methods’ accuracy scores on all lineages, see Additional file 1: Figure S15.
Robustness to clustering. Although Slingshot uses cluster labels for the identification of lineages and branching events, the subsequent use of simultaneous principal curves to obtain pseudotimes makes its final results quite robust to the choice of clustering method. In comparison, methods that project cells directly onto a clusterbased MST, such as TSCAN and Waterfall, are more dependent on the initial clustering and, particularly, on the locations of the cluster centers, which can be highly variable (Additional file 1: Figure S17).
We examined Slingshot’s robustness to the choice of clustering method using the simulated datasets of the twolineage topology and found that the particular clustering method is generally less important than the choice of K, the number of clusters (Fig. 5). For the three methods examined (hierarchical clustering, kmeans, and Gaussian mixture modeling), Slingshot consistently produced similar distributions of accuracy scores over a range of values for K (Fig. 5). This stability held whether we used a “good” dimensionality reduction, which generally led to high accuracy scores (4D PCA), or not (3D PCA). For a similar examination of the impact of different dimensionality reduction techniques, see Additional file 1: Figure S8.
This robustness is a result of Slingshot’s use of simultaneous principal curves to smooth the clusterbased MST, but there is still an important relationship between clusters and lineage inference. In extreme cases with too few clusters, the clusterbased MST may fail to identify a branching event, and with too many, it may identify spurious branching events. These issues are common to all clusterbased MST methods and not mitigated by the use of simultaneous principal curves. However, when the correct global lineage structure can be approximately identified, simultaneous principal curves allow for increased stability and decreased reliance on particular clustering results.
Conclusions
We have introduced a novel method, Slingshot, for lineage and pseudotime inference in singlecell genomics data. Because Slingshot breaks the inference problem into two steps, we are able to make use of appropriate methods for each task and avoid the common tradeoff between stability and the flexibility to detect complex structures. Using a clusterbased MST for lineage inference allows Slingshot to identify potentially complex global patterns in the data without being overly sensitive to individual data points. And our novel simultaneous principal curves method for pseudotime inference extends the stability and robustness properties of principal curves to the case of multiple branching lineages.
We demonstrated Slingshot’s ability to correctly detect a single lineage and two branching lineages, using the data of [3, 10] respectively (Additional file 1: Figure S2), and in both cases it produced results similar to those found and validated in the original publications. Furthermore, using the olfactory epithelium dataset of [26], we demonstrated that with minimal supervision, Slingshot could correctly identify a complex threelineage structure that other methods could not. Our simulation study showed that this advantage persisted over a range of input data types. For varying levels of noise and numbers of cells, Slingshot was able to infer accurate pseudotime variables more consistently than any other method, even with the same upstream dimensionality reduction techniques.
Unlike other methods, Slingshot does not restrict or require a priori knowledge of the number of lineages. The clusterbased minimum spanning tree enables the discovery of an arbitrary number of lineages, while also providing an intuitive framework for optional local supervision through the specification of the initial cluster and any number of terminal clusters. Lineage characteristics such as initial and terminal states can be difficult to identify at the level of individual cells due to dropout effects and high levels of noise in singlecell data. This presents a challenge for methods based on robust celltocell distances, such as Wishbone and DPT, the latter of which allows both beginning and endpoint specification at the level of individual cells. Conversely, more unsupervised methods, which only require an orientation for an otherwise unsupervised path, such as Monocle and Embeddr, can end up missing the initial state altogether. We find that local supervision at the cluster level provides a nice balance: due to averaging, clusters are less ambiguous than individual cells, making them easier to identify based on known marker genes, and specifying initial and terminal states provides an intuitive, but not overly restrictive way to ensure that inferred lineages are consistent with previously established results. Importantly, the (optional) specification of known terminal states is a form of local supervision that does not restrict the discovery of novel terminal states represented by other clusters. Furthermore, even in the case where all the terminal states are well characterized, the order and timing of branching events are often unknown and local supervision can enhance the inference of the global branching structure, as demonstrated in the “Results and discussion” section with the OE dataset of [26]. When there is no prior biological knowledge, Slingshot can be applied in an unsupervised manner as to the number and identity of terminal clusters.
It is also important to consider the amount of uncertainty in lineage and pseudotime inference, as this can impact downstream analyses such as the identification of differentially expressed genes along or between lineages, as noted in [30]. For branching lineage structures, there are two inextricably linked sources of uncertainty: the assignment of cells to lineages (“structural uncertainty”) and the calculation of each cell’s pseudotime (“temporal uncertainty”). While Slingshot only provides point estimates of lineage identities and pseudotimes, we note that it is generally computationally fast enough to be used in a bootstrap estimation procedure. Provided that the normalization, dimensionality reduction, and clustering steps are similarly fast and that any supervision provided by researchers can be automated, a bootstrap procedure could be used to assess uncertainty for the entire inference process.
Since there are many aspects to the problem of lineage inference, from sample collection to final analysis, it is important to define precisely the tasks for which Slingshot is designed. The philosophy of Slingshot is that upstream analysis steps such as normalization, dimensionality reduction, and clustering do not have a single solution that works well for all data types; these choices should therefore not be hardcoded into a lineage inference method. For example, Slingshot does not enforce a specific dimensionality reduction method because singlecell data can come from a variety of assays and in a wide range of dimensions, from the 271 cells×47,192 genes RNASeq dataset of [3] to the 25,000 cells×13 markers mass cytometry dataset of [9]. While the RGE method of Monocle 2 may work well in certain cases and the diffusion maps of Wishbone in others, this extreme heterogeneity seems to preclude any onesizefitsall solution. Similar arguments can be made for other upstream analysis steps. Instead, Slingshot was designed with modularity in mind. Though it will typically come after normalization, dimensionality reduction, and clustering steps in an analysis pipeline, it is not a method for addressing these problems. For example, Slingshot led to biologically meaningful and novel results with PCA in [26] and with diffusion maps in [31]. Slingshot was applied using our recommended singlecell RNASeq data analysis workflow in [19]: the pipeline includes the dataadaptive selection of a normalization procedure (scone package; [20]), dimensionality reduction using a zeroinflated negative binomial model (zinbwave package; [21]), and resamplingbased sequential ensemble clustering (RSEC; clusterExperiment package; [22]).
Ultimately, singlecell data are noisy, highdimensional, and may contain a multitude of competing, interwoven signals. In the presence of such data, Slingshot provides a robust and modular method for lineage and pseudotime inference, that allows for novel lineage discovery, meaningful incorporation of biological constraints, and fits easily within existing analysis pipelines.
Methods
We start from an n×J matrix of normalized expression measures (e.g., read counts) for n single cells and J genes or features. Slingshot assumes that the n cells have been partitioned into K clusters, potentially corresponding to distinct cellular states. Although Slingshot can in principle be applied directly to the normalized expression measures, we strongly recommend a dimensionality reduction step before pseudotemporal reconstruction, as Slingshot’s curvefitting step uses Euclidean (or related) distances, which can misbehave in highdimensional spaces (cf. curse of dimensionality). Dimensionality reduction can also strengthen signal in the data and help with visualization. We denote the dimension of the reduced space by J^{′}.
Before detailing Slingshot’s two main steps, we introduce some notation. First, denote by X=(X_{ ij }) the n×J^{′} reduceddimensional matrix of gene expression measures, for cells i∈{1,…,n} and dimensions j∈{1,…,J^{′}}. Let \(\left \{\mathcal {C}_{1},\ldots,\mathcal {C}_{K}\right \}\) denote the K cell clusters or states, i.e., disjoint subsets of cells, typically obtained by clustering the cells based on their gene expression measures. We then define a lineage as an ordered set of clusters and let L denote the total number of lineages. For a particular lineage, \(\mathcal {L}_{l}\), denote its length (i.e., the number of clusters in the lineage) by K_{ l } and the k^{th} cluster by \(\mathcal {C}^{l}_{k}\), for l∈{1,…,L} and k∈{1,…,K_{ l }}. In particular, \(\mathcal {C}^{l}_{1}\) and \(\mathcal {C}^{l}_{K_{l}}\) correspond, respectively, to the initial and terminal states for the l^{th} lineage. It is important to note that a cluster can belong to multiple lineages and that the ordering of the clusters within a lineage does not strictly determine the final relative orderings of cells in those clusters.
As a given cluster can belong to multiple lineages, so can a cell. We therefore allow cells to have distinct pseudotime values for each lineage they are a part of. The pseudotime value for cell i in lineage l is denoted by \(t^{l}_{i} \in \mathbb {R}_{\geq 0}\); if cell i does not belong to lineage l, i.e., \(i \notin \cup _{k=1}^{K_{l}} \mathcal {C}^{l}_{k}\), then set \(t^{l}_{i} = \emptyset \). The vector of pseudotime values for lineage l is denoted by \(\mathbf {t}^{l} = \left (t^{l}_{i}: i=1,\ldots,n\right)\).
Identification of clusterbased lineages
In its first step, Slingshot identifies lineages by treating clusters of cells as nodes in a graph and drawing a minimum spanning tree (MST) between the nodes, similar to the work of [7, 10]. Lineages are then defined as ordered sets of clusters created by tracing paths through the MST, starting from a given root node. Our method differs however in a number of important respects from those of [7, 10] including the distance measure used for drawing the tree and the (optional) incorporation of biologically meaningful supervision.
Shapesensitive distance measure between cell clusters
Constructing an MST involves specifying a distance measure between nodes (in this case, cell clusters). We have found that a Mahalanobislike distance, i.e., a covariancescaled Euclidean distance, that accounts for cluster shape, works well in practice, but users have the option of specifying any type of distance measure (e.g., Euclidean, Manhattan). Specifically, the pairwise distance between clusters i and j, \(d(\mathcal {C}_{i},\mathcal {C}_{j})\), is defined as
where \(\bar {X}_{i}\) represents the center (mean) of cluster i and S_{ i } its empirical covariance matrix in the reduceddimensional space. This is essentially a multivariate tstatistic. By default, Slingshot uses the full covariance matrix of each cluster, allowing us to draw trees that are better covered by and representative of the cells in a dataset. However, in the presence of small clusters, the matrix S_{ i }+S_{ j } may not be invertible and we may replace the full covariance matrix with the corresponding diagonal covariance matrix.
Some clustering algorithms return probabilities of cluster membership rather than hard assignments. In these cases, the cluster membership probabilities can be naturally and readily incorporated as weights in most distance measures. For instance, for the Mahalanobislike distance of Eq. 1, we would compute weighted means and covariance matrices.
Biologically meaningful supervision
Slingshot allows two forms of supervision during lineage identification: initial state and terminal states specification. Like other methods (TSCAN, Waterfall, Monocle 2), Slingshot requires the user to identify the initial cluster or root node. Subsequently, every direct path from this node to a leaf node (i.e., a cluster with only one edge) will be called a lineage. Indeed, all existing lineage inference methods explicitly or implicitly make the assumption that a starting state can be identified by the user: Monocle and Embeddr construct orderings for which the user must select the correct direction and Wishbone and DPT require the user to select an initial cell or group of cells. In the simple case where the MST constructed by Slingshot has only two leaf nodes and one is specified as the root, this results in a single lineage. If an interior (nonleaf) node is specified as the origin, this results in two lineages, one terminating in each leaf node. Clusters with more than two edges will create bifurcations and produce additional lineages.
Additionally, Slingshot optionally allows the user to provide further supervision in the inference of the lineages by selecting clusters known to represent terminal cell states, imposing a local constraint on the MST algorithm. The constrained MST is obtained by first constructing the MST on all nonselected clusters and then connecting each selected cluster to its nearest nonselected neighbor. Such local supervision results in more biologically meaningful lineages for situations where the data can be explained by many possible lineage structures. Identified lineages are by construction consistent with known biology and provide improved stability over less supervised methods. Although terminal state supervision is not required, in many settings researchers do have knowledge of the cell types present in their data and systematically incorporating this knowledge can provide more accurate and stable inference. Importantly, this type of local supervision does not prevent the discovery of novel lineages; it allows the incorporation of specific knowledge of cell clusters, without imposing restrictions on the global branching structure. Ultimately, detecting multiple lineages based on gene expression data is a difficult problem that benefits from such guidance, as we demonstrate in the “Results and discussion” section.
Identification of individual cell pseudotimes
The second stage of Slingshot is concerned with assigning pseudotimes to individual cells. For this purpose, we make use of principal curves [13] to draw a path through the gene expression space of each lineage. As we show in the “Results and discussion” section, principal curves give very robust pseudotimes when there is a single lineage. Multiple lineages demand more care and are handled using the simultaneous principal curves method proposed below. Indeed, just as clusters in the MST may belong to one or more lineages, the cells which constitute these clusters may be assigned to one or more lineages. In principle, we could construct standard principal curves for each lineage separately to arrive at pseudotimes. However, there is no guarantee that these curves would agree with each other in the neighborhood of clusters shared between lineages, so cells belonging to multiple lineages could be assigned very different pseudotime orderings by each curve. Since we assume a smooth differentiation process, this is potentially a violation and may be problematic in downstream analysis.
We therefore introduce a method of simultaneously fitting the principal curves of each lineage, which shrinks the curves to a consensus path in areas where lineages share many common cells, but allows the curves to separate as they share fewer and fewer cells. This ensures smooth bifurcations of the paths. We call the resulting curves simultaneous principal curves, as they are fit by an iterative procedure based on the principal curves algorithm of [13]. When there is only a single lineage (L=1), the pseudotimes of Slingshot are found by the standard principal curves algorithm, except that the initial curve is based on the lineage’s path through the MST found in the first stage (see below for details), rather than the first principal component. Additional file 1: Figure S19 illustrates the main steps in the simultaneous principal curves algorithm.
Standard principal curves algorithm. We first review the standard principal curves algorithm of [13] (for a single curve) in order to be clear about how we adapt it for simultaneous principal curves. After specification of an initial curve, the algorithm iteratively follows these steps:

1. Project all data points onto the curve and calculate the arc length from the beginning of the curve to each point’s projection. Setting the lowest value to zero, this produces pseudotimes.

2. For each dimension j, j∈{1,…,J^{′}}, use the cells’ pseudotimes to predict their coordinates, typically with a smoothing spline. This produces a set of J^{′} functions which collectively map pseudotime values in \(\mathbb {R}_{\geq 0}\) into \(\mathbb {R}^{J'}\), thereby defining a smooth curve in J^{′} dimensions.

3. Repeat this process until convergence. We use the sum of squared distances between cells’ actual coordinates and their projections on the curves to determine convergence.
We note that these curves use the unitspeed parameterization, meaning that a principal curve defined by \(\mathbf {c}(t):\mathbb {R}_{\geq 0} \rightarrow \mathbb {R}^{J^{\prime }}\) will satisfy c^{′}(t)=1 at all points t in the domain of c. This property ensures the equivalence between arc length and pseudotime mentioned in Step 1.
In order to characterize multiple branching lineages, we modify the iterative principal curves algorithm in two ways: by incorporating cell weights representing their assignment to particular lineages and by adding a shrinkage procedure to ensure smooth branching events. The cell weights are added in Step 1, with each cell’s weight for a given lineage being based on its projection distance to the curve representing that lineage. The shrinkage is performed in Step 2, by first recursively constructing an average curve for each branching event, then recursively shrinking the branching lineage curves toward this average. Thus, as with the individual lineage curves, each average curve is a function of pseudotime and can, itself, be averaged and shrunk.
In the case of branching lineages, where L is the total number of lineages (i.e., terminal states), our goal is to infer, for each lineage l∈{1,…,L}, a vector of pseudotime values, \(\mathbf {t}^{l} = \left (t^{l}_{i}: i=1,\ldots,n\right)\), and a vectorvalued function, \(\mathbf {c}_{l}: \mathbb {R}_{\geq 0} \rightarrow \mathbb {R}^{J^{\prime }}\), for the associated curve in the lowdimensional space.
Average curve construction for each branching event. Average curves are constructed in a recursive manner, from the latest branching events to the earliest (i.e., from the leaves of the MST to the root). Consider a branching event involving M curves (typically M=2), \(\mathbf {c}_{m}: \mathbb {R}_{\geq 0} \rightarrow \mathbb {R}^{J'}\), m=1,…,M, which may either be individual lineage curves (for branching events leading to leaf nodes) or average curves (for lineages differentiating in later branching events). The average curve is simply defined as
for values of t in the domains of each curve being averaged. Because all lineages share the same root cluster, we ensure that the starting point of all average curves (c_{avg}(0)) will be identical, as will the starting point of the resulting shrunken curves. For branching events leading to leaf nodes, the curves being averaged will be individual lineage curves, whereas earlier branching events may also involve averaging average curves.
This recursive procedure ensures that the average curves constructed for early branching events are blind to the number of lineages ultimately produced by each branch. Without this condition, an early bifurcation event between a lineage that ends in a single terminal state and another that gives rise to multiple terminal states would produce an average curve that was strongly biased toward the latter branch.
Shrinkage for each branching event. Next, we perform shrinkage for each branching event, bringing the branching curves into better agreement in regions of shared cells. Unlike the construction of the average curves, this recursive process starts with the root and works out toward the leaves, meaning that the earliest branching event is the first to be shrunk. Let c_{avg} denote the average curve for a given branching event and let c_{ m } denote one of the M curves to be shrunk at this event. Again, it may be the case that the curves being shrunk together at this step represent single lineages or averages of other curves. To determine how much each curve is shrunk toward the average, we construct curvespecific weighting functions \(w_{m}: \mathbb {R}_{\geq 0} \rightarrow [0,1]\), as detailed below, with the constraint that w_{ m } must be nonincreasing. Additionally, by specifying that w_{ m }(0)=1 (representing the maximum amount of shrinkage), we ensure that diverging curves always share the same initial point. These weighting functions allow us to shrink the diverging curves toward the average curve with the additional update in Step 2:
If all the weighting functions are smooth, this shrinkage step ensures that the final curves will follow a tree structure with smooth branching events.
Weighting functions for each branching event. Slingshot’s default weighting functions satisfy these conditions, i.e., are smooth, nonincreasing, and take on a value of one at the origin. They are based on the distribution of pseudotimes for cells shared between the lineages corresponding to the branching curves. Specifically, for a branching event involving lineages {1,…,H}, we define a set of shared cells \(\left \{i: t_{i}^{1} \neq \emptyset,\ldots, t_{i}^{H} \neq \emptyset \right \}\) and, for one of the M curves c_{ m } to be shrunk at this event, we let \(t_{min}^{m}\) and \(t_{max}^{m}\) denote, respectively, the lowest and highest nonoutlier pseudotimes for these cells along the curve (where outliers are defined by the 1.5 IQR rule of boxplots, where IQR stands for interquartile range). The weighting function for curve c_{ m } is then defined as:
where F_{ K } is the cumulative distribution function of a standard cosine kernel with a bandwidth of \(\frac {1}{6}\) (which places weight only on values between \(\frac {1}{2}\) and \(\frac {1}{2}\)). The final curves are highly robust to the choice of kernel function (Additional file 1: Figure S20).
In both the single and branching lineage cases, final pseudotime values are derived from each point’s orthogonal projection onto the curves. In the latter case, assignment of cells to lineages is determined by cell weights, which are calculated in Step 1 of the algorithm, using a cell’s projection distance to each lineage curve. Cell weights may be useful in downstream analyses, such as the identification of genes that are differentially expressed along and between lineages.
Cells belonging to multiple lineages will have multiple pseudotime values, but these values will agree quite well for cells positioned before the lineage bifurcation. This is because all curves share a common point of origin, c_{ m }(0), and the weighting functions w_{ m }, which determine the amount of shrinkage, assign unit weight to the origin (complete shrinkage) and decrease smoothly throughout the neighborhood of shared cells. Therefore, in the region prior to the bifurcation, shrinkage forces the curves to closely follow their average curve and the pseudotimes obtained by projection onto these curves will be highly similar. Additional file 1: Figure S19e shows the improved agreement between simultaneous principal curves as compared to separate, standard principal curves.
Initialization of simultaneous principal curves algorithm. As mentioned above, we initialize the algorithm using the MST from the first stage. Specifically, for each lineage, we start with the piecewise linear path through the centers of the clusters contained in the lineage (in contrast, standard principal curves are initialized by the first principal component over all cells). Starting with the path through the cluster centers allows us to leverage the prior knowledge that went into lineage identification as well as to improve the speed and stability of the algorithm, though in practice, the two procedures typically converge to very similar curves.
Datasets
We demonstrate the performance of Slingshot by applying it to three previously published singlecell RNASeq datasets, each with a different number of terminal cell types.
HSMM dataset. The first dataset is a subset of the data used in [3], which assayed 271 human skeletal muscle myoblasts (HSMM) in order to study their development into mature myotubes. This is an example of data with only a single lineage. In their analysis, [3] identify a population of contaminating interstitial mesenchymal cells, which we omit from the dataset. This results in a sample of 212 cells believed to form a single, continuous developmental lineage. For our analysis, we used the cluster labels generated by Monocle as well as a set of labels obtained via kmeans clustering for a range of values of k, and, as in the original paper, we represented the data in two dimensions obtained by ICA. The normalized data were downloaded from the NCBI GEO database (accession GSE52529).
qNSC dataset. The second dataset comes from [10], who assayed 132 hippocampal quiescent neural stem cells (qNSC) and their immediate progeny from adult mice, cells known to be involved in neurogenesis. Their goal was to assess cellular heterogeneity among this population and analyze continuoustime developmental dynamics. After removing a few outliers, their analysis focuses on 101 cells believed to represent the development of qNSCs into intermediate progenitor cells (IPC), a transitional state between qNSCs and mature neurons. However, they note an additional cluster of 23 cells branching off of this lineage, potentially representing an alternative terminal cell type. As in the original paper, we used the hierarchical clustering labels and the first two principal components as the reduceddimensional space. Rather than focus solely on the IPC lineage though, we characterized the developmental trajectory of both proposed cell fates. The normalized data and code for preliminary analysis were downloaded from GEO (accession GSE71485).
OE dataset. The third dataset is that of [26], featuring 616 cells from the adult mouse olfactory epithelium (OE), tracing the development of quiescent stem cells into three unique terminal cell fates. The primary lineage maps the development of horizontal basal cells (HBC) into mature olfactory sensory neurons (mOSN) via a series of intermediate states. The secondary lineage gives rise to the support sustentacular (mSus) cells of this system and features fewer identifiable intermediates. A third lineage, which appears to split from the neuronal path, leads to a cluster of microvillous (MV) cells. Again, we relied on the cluster labels of the authors, who used a resamplingbased sequential ensemble clustering (RSEC) approach [22], and represent cells by their coordinates along the first five principal components. The normalized data and cluster labels are available from GEO (accession GSE95601).
Simulation study
Simulation parameters. In order to examine the performance of Slingshot and other methods in a wide range of scenarios, we performed a simulation study using the Bioconductor R package splatter [28] to produce artificial singlecell RNASeq datasets. Many parameters can potentially be tuned to generate these datasets, including parameters determining the distribution of mean gene expression, library size, outlier expression, dropout, and the biological coefficient of variation. In order to make our simulation study as realistic as possible, we used a published dataset [3] to learn properties of the marginal distributions of the expression measures for both genes and samples.
In the first part of the study, simulated datasets consisted of two branching lineages (Fig. 4a). The number of cells n was varied from 120 to 1500, by increments of 60 cells. Additionally, we adjusted the signaltonoise ratio by varying the probability of a gene being differentially expressed (DE) along a path between 0.1 (weak signal) and 0.5 (strong signal), by increments of 0.1. For each combination of sample size and DE proportion, we simulated 10 datasets, for a total of 1,200. In the second part, simulated datasets consisted of five branching lineages (Fig. 4c). The number of cells n was varied between 220 and 1,320, by increments of 220. The DE proportion was varied between 0.1 and 0.5, as in the twolineage setting. Since all methods under consideration can accommodate nonlinear paths, the probability of nonlinear DE patterns was set to 0.5, meaning that half of all DE genes’ true average expression level varied according to a nonlinear function of pseudotime.
Clustering. We examined Slingshot’s robustness to the choice of clustering method by performing hierarchical clustering, kmeans clustering, and Gaussian mixture modeling (GMM), to obtain K=3 to 10 clusters on the threedimensional representation of each simulated dataset obtained by PCA. Fixing the dimensionality reduction technique allows us to focus on the effects of the clustering method for the dimensionality reduction technique used. In order to alleviate the potential impact of outliers, whenever any method identified a cluster consisting of 4 cells or fewer, that cluster was removed and the method was rerun on the remaining cells.
For the purpose of comparing Slingshot with other lineage inference methods, we again used the top three principal components and set the clustering technique to be the Gaussian mixture model which minimizes the Bayesian information criterion (BIC). This is the default behavior of the mclust R package [32] and similar to the approach taken by TSCAN, which uses a variable number of principal components inferred from the data.
Evaluation. Methods were evaluated according to the agreement between inferred and true pseudotime variables for each lineage, as measured by the Kendall rank correlation coefficient. The Kendall rank correlation coefficient assesses the ordinal association between inferred pseudotimes and true pseudotimes, making it more robust to outliers and nonlinearity than the Pearson correlation coefficient. We use a slight variant of this measure designed to reflect errors in the assignment of cells to lineages. Defining \(\mathcal {S}_{0}\) as the set of cells along a true lineage and \(\mathcal {S}_{1}\) as the set of cells along an inferred lineage, we calculate:
where concordant and discordant pairs are defined strictly, not allowing for ties. Hence, only cells belonging to both the true and inferred lineages (i.e., in \(\mathcal {S}_{0} \cap \mathcal {S}_{1}\)) contribute to the numerator. Cells which are along the true lineage (i.e., elements of \(\mathcal {S}_{0}\)) and not assigned a pseudotime by the inferred lineage (not in \(\mathcal {S}_{1}\)) will only contribute to the denominator, bringing τ closer to 0. Similarly for extraneous cells which are included in \(\mathcal {S}_{1}\) but not in \(\mathcal {S}_{0}\).
For each true lineage, we take the maximum τ over all inferred lineages and average these values within a single dataset. This produces a bias in favor of methods that identify many, potentially spurious lineages, as there will be more values over which to take the maximum. We do not correct for this bias, but simply note that Monocle 2 and DPTFull are the methods which seem to benefit the most from it.
Abbreviations
 BIC:

Bayesian information criterion
 DDRTree:

Discriminative dimensionality reduction via learning a tree
 DE:

Differential expression
 DPT:

Diffusion pseudotime
 GBC:

Globose basal cell
 GEO:

Gene expression omnibus
 GPLVM:

Gaussian process latent variable model
 GMM:

Gaussian mixture modeling
 HBC:

Horizontal basal cell
 HSMM:

Human skeletal muscle myoblast
 ICA:

Independent component analysis
 IPC:

Intermediate progenitor cell
 kNN:

k nearest neighbors
 MCMC:

Markov chain MonteCarlo
 MFA:

Mixture of factor analysers
 mOSN:

Mature olfactory sensory neuron
 MST:

Minimum spanning tree
 mSus:

Mature sustentacular
 MV:

Microvillous
 NCBI:

National center for biotechnology information
 OE:

Olfactory epithelium
 OMGP:

Overlapping mixtures of Gaussian processes
 PCA:

Principal component analysis
 qNSC:

quiescent neural stem cells
 RGE:

Reverse graph embedding
 RNASeq:

Ribonucleic acid sequencing
 RSEC:

Resamplingbased sequential ensemble clustering
 tSNE:

tdistributed stochastic neighbor embedding
 TSCAN:

Tools for SingleCell ANalysis
References
 1
Kolodziejczyk AA, Kim JK, Svensson V, Marioni JC, Teichmann SA. The technology and biology of singlecell RNA sequencing. Mol Cell. 2015; 58(4):610–20.
 2
Wagner A, Regev A, Yosef N. Revealing the vectors of cellular identity with singlecell genomics. Nat Biotechnol. 2016; 34(11):1145–60.
 3
Trapnell C, Cacchiarelli D, Grimsby J, Pokharel P, Li S, Morse M, Lennon NJ, Livak KJ, Mikkelsen TS, Rinn JL. The dynamics and regulators of cell fate decisions are revealed by pseudotemporal ordering of single cells. Nat Biotechnol. 2014; 4(32):381–91.
 4
Bendall S, Davis KL, Amir ED, Tadmor MD, Simonds EF, Chen TJ, Shenfeld DK, Nolan GP, Pe’er D. Singlecell trajectory detection uncovers progression and regulatory coordination in human B cell development. Cell. 2014; 157(3):714–25.
 5
Campbell K, Ponting CP, Webber C. Laplacian eigenmaps and principal curves for high resolution pseudotemporal ordering of singlecell RNAseq profiles. Technical report, Functional Genomics Unit, MRC, University of Oxford, UK. 2015. biorxiv.org/content/early/2015/09/18/027219.
 6
Haghverdi L, Büttner M, Wolf FA, Buettner F, Theis FJ. Diffusion pseudotime robustly reconstructs lineage branching. Nat Methods. 2016; 13(10):845–8. https://doi.org/10.1038/nmeth.3971. Accessed 26 July 2017.
 7
Ji Z, Ji H. TSCAN: Pseudotime reconstruction and evaluation in singlecell RNAseq analysis. Nucleic Acids Res. 2016; 44(13):117. https://doi.org/10.1093/nar/gkw430.
 8
Qiu X, Hill A, Packer J, Lin D, Ma YA, Trapnell C. Singlecell mRNA quantification and differential analysis with Census. Nat Methods. 2017; 14(3):309–15. https://doi.org/10.1038/nmeth.4150. Accessed 26 Sept 2017.
 9
Setty M, Tadmor MD, ReichZeliger S, Angel O, Salame TM, Kathail P, Choi K, Bendall S, Friedman N, Pe’er D. Wishbone identifies bifurcating developmental trajectories from singlecell data. Nat Biotechnol. 2016; 34(6):637–45. https://doi.org/10.1038/nbt.3569. Accessed 18 Nov 2016.
 10
Shin J, Berg DA, Zhu Y, Shin JY, Song J, Bonaguidi MA, Enikolopov G, Nauen DW, Christian KM, Ming G, Song H. Singlecell RNASeq with Waterfall reveals molecular cascades underlying adult neurogenesis. Cell Stem Cell. 2015; 17(3):360–72.
 11
Saelens W, Cannoodt R, Todorov H, Saeys Y. A comparison of singlecell trajectory inference methods: towards more accurate and robust tools. 2018:276907. https://www.biorxiv.org/content/early/2018/03/05/276907. Accessed 3 May 2018.
 12
Bacher R, Kendziorski C. Design and computational analysis of singlecell RNAsequencing experiments. Genome Biol. 2016; 17(63):63.
 13
Hastie T, Stuetzle W. Principal curves. J Am Stat Assoc. 1989; 84(406):502–16.
 14
Belkin M, Niyogi P. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Comput. 2003; 15(6):1373–96. https://doi.org/10.1162/089976603321780317.
 15
Lönnberg T., Svensson V, James KR, FernandezRuiz D, Sebina I, Montandon R, Soon MSF, Fogg LG, Nair AS, Liligeto UN, Stubbington MJT, Ly L, Bagger FO, Zwiessele M, Lawrence ND, SouzaFonsecaGuimaraes F, Bunn PT, Engwerda CR, Heath WR, Billker O, Stegle O, Haque A, Teichmann SA. Singlecell RNAseq and computational analysis using temporal mixture modeling resolves TH1/TFH fate bifurcation in malaria. Sci Immunol. 2017; 2(9):2192. https://doi.org/10.1126/sciimmunol.aal2192. Accessed 29 Sept 2017.
 16
Reid JE, Wernisch L. Pseudotime estimation: deconfounding single cell time series. Bioinforma (Oxford, England). 2016; 32(19):2973–80. https://doi.org/10.1093/bioinformatics/btw372.
 17
Campbell KR, Yau C. Probabilistic modeling of bifurcations in singlecell gene expression data using a Bayesian mixture of factor analyzers. Wellcome Open Res. 2017; 2. https://doi.org/10.12688/wellcomeopenres.11087.1.
 18
Maaten LVD, Hinton G. Visualizing Data using tSNE. J Mach Learn Res. 2008; 9:2579–605. https://doi.org/10.1007/s1047901108413.
 19
Perraudeau F, Risso D, Street K, Purdom E, Dudoit S. Bioconductor workflow for singlecell rna sequencing: Normalization, dimensionality reduction, clustering, and lineage inference. F1000Research. 2017; 6:1158.
 20
Cole MB, Risso D, Wagner A, DeTomaso D, Ngai J, Purdom E, Dudoit S, Yosef N. Performance Assessment and Selection of Normalization Procedures for SingleCell RNASeq. 2017. bioRxiv 235382.
 21
Risso D, Perraudeau F, Gribkova S, Dudoit S. JP Vert A general and flexible method for signal extraction from singlecell RNAseq data. Nat Commun. 2018; 9(1):284.
 22
Risso D, Purvis L, Fletcher R, Das D, Ngai J, Dudoit S, Purdom E. ClusterExperiment and RSEC: A Bioconductor package and framework for clustering of singlecell and other large gene expression datasets. 2018. bioRxiv 280545.
 23
Chubb JR, Trcek T, Shenoy SM, Singer RH. Transcriptional Pulsing of a Developmental Gene. Curr Biol. 2006; 16(10):1018–25. https://doi.org/10.1016/j.cub.2006.03.092. Accessed 10 Apr 2017.
 24
Raj A, Peskin CS, Tranchina D, Vargas DY, Tyagi S. Stochastic mRNA Synthesis in Mammalian Cells. PLoS Biol. 2006; 4(10):309. https://doi.org/10.1371/journal.pbio.0040309. Accessed 10 Apr 2017.
 25
Kharchenko PV, Silberstein L, Scadden DT. Bayesian approach to singlecell differential expression analysis. Nat Methods. 2014; 11(7):740–2. https://doi.org/10.1038/nmeth.2967. Accessed 10 Apr 2017.
 26
Fletcher RB, Das D, Gadye L, Street K, Baudhuin A, Risso D, Wagner A, Cole MB, Flores Q, Choi YG, Yosef N, Purdom E, Dudoit S, Ngai J. Deconstructing Olfactory Stem Cell Trajectories at SingleCell Resolution. Cell Stem Cell. 2017; 20(6):817–30. https://doi.org/10.1016/j.stem.2017.04.003. Accessed 11 May 2017.
 27
Mahalanobis PC. On the generalized distance in statistics. Proc Natl Inst Sci (Calcutta). 1936; 2:49–55.
 28
Zappia L, Phipson B, Oshlack A. Splatter: simulation of singlecell RNA sequencing data. Genome Biol. 2017; 18:174. https://doi.org/10.1186/s1305901713050.
 29
Soneson C, Robinson MD. Bias, Robustness And Scalability In Differential Expression Analysis Of SingleCell RNASeq Data. bioRxiv. 2017:143289. https://doi.org/10.1101/143289. Accessed 22 Nov 2017.
 30
Campbell KR, Yau C. Order Under Uncertainty: Robust Differential Expression Analysis Using Probabilistic Models for Pseudotime Inference. PLoS Comput Biol. 2016; 12(11):1005212. https://doi.org/10.1371/journal.pcbi.1005212. Accessed 29 Sept 2017.
 31
Stevant I, Neirijnck Y, Borel C, Escoffier J, Smith LB, Antonarakis SE, Dermitzakis ET, Nef S. Deciphering cell lineage specification during male sex determination with singlecell RNA sequencing. bioRxiv. 2017:190264. https://doi.org/10.1101/190264. Accessed 21 Sept 2017.
 32
Scrucca L, Fop M, Murphy TB, Raftery AE. mclust 5: clustering, classification and density estimation using Gaussian finite mixture models. R J. 2016; 8(1):205–33.
Acknowledgements
We thank Mary Combs for suggesting the name Slingshot.
Funding
KS, DR, JN, NY, EP, and SD were supported by a National Institute of Mental Health BRAIN Initiative grant (U01MH105979). Additionally, research in JN’s lab was funded by the National Institute on Deafness and Other Communication Disorders (RO1DC007235), the National Center for Research Resources (S10RR029668), and the Siebel Foundation. RBF was supported by the National Institute on Aging (K01AG045344), KS and DD by training grants from the National Human Genome Research Institute (T32HG000047), and RBF and DD by a training grant from the California Institute of Regenerative Medicine.
Availability of data and materials
Slingshot is implemented in the R programming language and publiclyavailable through an opensource package on GitHub (https://github.com/kstreet13/slingshot). The package will be submitted to the Bioconductor Project (http://www.bioconductor.org).
Competing Interests
The authors declare that they have no competing interests.
Author information
Affiliations
Contributions
KS, DR, EP, and SD formulated the methodology. JN participated in experimental strategy and design. NY conceived the endpoint supervision strategy. KS and DR wrote the R package. KS, RBF, and DD performed the OE data analysis. KS, DR, EP, and SD wrote the manuscript. All authors have read and approved the manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Ethics approval and consent to participate were not applicable to this study.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Additional file
Additional file 1
Supplemental methods for the analysis of the olfactory epithelium data and supplemental figures 120. (ZIP 34910 kb)
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Street, K., Risso, D., Fletcher, R. et al. Slingshot: cell lineage and pseudotime inference for singlecell transcriptomics. BMC Genomics 19, 477 (2018). https://doi.org/10.1186/s1286401847720
Received:
Accepted:
Published:
Keywords
 RNASeq
 Single cell
 Lineage inference
 Pseudotime inference