Trajectory inference: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
m I modified the description of the Slingshot method (under Software) to be more in line with the description given in the paper.
No edit summary
Line 25: Line 25:


=== Slingshot ===
=== Slingshot ===
Slingshot takes cluster labels as input and then orders these clusters into lineages by the construction of a [[minimum spanning tree]]. Paths through the tree are smoothed by fitting simultaneous principal curves and a cell's pseudotime value is determined by its projection onto one or more of these curves. Prior information, such as initial and terminal clusters, is optional.<ref name=":10">{{Cite journal|last=Street|first=Kelly|last2=Risso|first2=Davide|last3=Fletcher|first3=Russell B.|last4=Das|first4=Diya|last5=Ngai|first5=John|last6=Yosef|first6=Nir|last7=Purdom|first7=Elizabeth|last8=Dudoit|first8=Sandrine|date=2017-04-19|title=Slingshot: Cell lineage and pseudotime inference for single-cell transcriptomics|url=https://www.biorxiv.org/content/early/2017/04/19/128843|journal=bioRxiv|language=en|pages=128843|doi=10.1101/128843}}</ref>
Slingshot takes cluster labels as input and then orders these clusters into lineages by the construction of a [[minimum spanning tree]]. Paths through the tree are smoothed by fitting simultaneous principal curves and a cell's pseudotime value is determined by its projection onto one or more of these curves. Prior information, such as initial and terminal clusters, is optional.<ref name=":10">{{Cite journal|last=Street|first=Kelly|last2=Risso|first2=Davide|last3=Fletcher|first3=Russell B.|last4=Das|first4=Diya|last5=Ngai|first5=John|last6=Yosef|first6=Nir|last7=Purdom|first7=Elizabeth|last8=Dudoit|first8=Sandrine|date=2018-06-19|title=Slingshot: cell lineage and pseudotime inference for single-cell transcriptomics|url=https://doi.org/10.1186/s12864-018-4772-0|journal=BMC Genomics|language=en|volume=19|pages=477|doi=10.1186/s12864-018-4772-0}}</ref>


=== TSCAN ===
=== TSCAN ===

Revision as of 20:13, 17 April 2019

Trajectory inference as implemented in Slingshot for (a) a simulated two-dimensional dataset and (b) a single-cell RNA-seq dataset of the olfactory epithelium.

Trajectory inference or pseudotemporal ordering is a comptutational technique used in single-cell transcriptomics to determine the pattern of a dynamic process experienced by cells and then arrange cells based on their progression through the process. Single-cell protocols have much higher levels of noise than bulk RNA-seq,[1] so a common step in a single-cell transcriptomics workflow is the clustering of cells into subgroups.[2] Clustering can contend with this inherent variation by combining the signal from many cells, while allowing for the identification of cell types.[3] However, some differences in gene expression between cells are the result of dynamic processes such as the cell cycle, cell differentiation, or response to an external stimuli. Trajectory inference seeks to characterize such differences by placing cells along a continuous path that represents the evolution of the process rather than dividing cells into discrete clusters.[4] In some methods this is done by projecting cells onto an axis called pseudotime which represents the progression through the process.[5]

Methods

Since 2015, more than 50 algorithms for trajectory inference have been created.[6] Although the approaches taken are diverse there are some commonalities to the methods. Typically, the steps in the algorithm consist of dimensionality reduction to reduce the complexity of the data, trajectory building to determine the structure of the dynamic process, and projection of the data onto the trajectory so that cells are positioned by their evolution through the process and cells with similar expression profiles are situated near each other.[6] Trajectory inference algorithms differ in the specific procedure used for dimensionality reduction, the kinds of structures that can be used to represent the dynamic process, and the prior information that is required or can be provided.[7]

PCA of a multivariate Gaussian distribution. The vectors shown are the first (longer vector) and second principal components, which indicate the directions of maximum variance.

Dimensionality Reduction

The data produced by single-cell RNA-seq can consist of thousands of cells each with expression levels recorded across thousands of genes.[8] In order to efficiently process data with such high dimensionality many trajectory inference algorithm employ a dimensionality reduction procedure such as principal component analysis (PCA), independent component analysis (ICA), or t-SNE as their first step.[9] The purpose of this step is to combine many features of the data into a more informative measure of the data.[4] For example, a coordinate resulting from dimensionality reduction could combine expression levels from many genes that are associated with the cell cycle into one value that represents a cell's position in the cell cycle.[9] Such a transformation corresponds to dimensionality reduction in the feature space, but dimensionality reduction can also be applied to the sample space by clustering together groups of similar cells.[1]

Trajectory Building

A graph with six vertices. Many trajectory inference algorithms use graphs to build the trajectory.

Many methods represent the structure of the dynamic process via a graph-based approach. In such an approach the vertices of the graph correspond to states in the dynamic process, such as cell types in cell differentiation, and the edges between the nodes correspond to transitions between the states.[6] The creation of the trajectory graph can be accomplished using k-nearest neighbors or minimum spanning tree algorithms.[10] The topology of the trajectory refers to the structure of the graph and different algorithms are limited to creation of graph topologies of a particular type such as linear, branching, or cyclic.[4]

Use of prior information

Some methods require or allow for the input of prior information which is used to guide the creation of the trajectory. The use of prior information can lead to more accurate trajectory determination, but poor priors can lead the algorithm astray or bias results towards expectations.[6] Examples of prior information that can be used in trajectory inference are the selection of start cells that are at the beginning of the trajectory, the number of branches in the trajectory, and the number of end states for the trajectory.[11]

Software

Monocle

Monocle first employs a differential expression test to reduce the number of genes then applies independent component analysis for additional dimensionality reduction. To build the trajectory Monocle computes a minimum spanning tree, then finds the longest connected path in that tree. Cells are projected onto the nearest point to them along that path.[5]

p-Creode

p-Creode finds the most likely path through a density-adjusted k-nearest neighbor graph. Graphs from an ensemble are scored with a graph similarity metric to select the most representative topology.  p-Creode has been tested on a range of single-cell platforms, including mass cytometry, multiplex immunofluorescence,[12] and single-cell RNA-seq. No prior information is required.[13]

Slingshot

Slingshot takes cluster labels as input and then orders these clusters into lineages by the construction of a minimum spanning tree. Paths through the tree are smoothed by fitting simultaneous principal curves and a cell's pseudotime value is determined by its projection onto one or more of these curves. Prior information, such as initial and terminal clusters, is optional.[11]

TSCAN

TSCAN performs dimensionality reduction using principal component analysis and clusters cells using a mixture model. A minimum spanning tree is calculated using the centers of the clusters and the trajectory is determined as the longest connected path of that tree. TSCAN is an unsupervised algorithm that requires no prior information.[14]

Wanderlust/Wishbone

Wanderlust was developed for analysis of mass cytometry data, but has been adapted for single-cell transcriptomics applications. A k-nearest neighbors algorithm is used to construct a graph which connects every cell to the cell closest to it with respect to a metric such as Euclidean distance or cosine distance. Wanderlust requires the input of a starting cell as prior information.[15]

Wishbone is built on Wanderlust and allows for a bifurcation in the graph topology, whereas Wanderlust creates a linear graph. Wishbone combines principal component analysis and diffusion maps to achieve dimensionality reduction then also creates a KNN graph.[16]

Waterfall

Waterfall performs dimensionality reduction via principal component analysis and uses a k-means algorithm to find cell clusters. A minimal spanning tree is built between the centers of the clusters. Waterfall is entirely unsupervised, requiring no prior information, and produces linear trajectories.[17]

References

  1. ^ a b Bacher, Rhonda; Kendziorski, Christina (2016-04-07). "Design and computational analysis of single-cell RNA-sequencing experiments". Genome Biology. 17 (1): 63. doi:10.1186/s13059-016-0927-y. ISSN 1474-760X. PMC 4823857. PMID 27052890.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  2. ^ Hwang, Byungjin; Lee, Ji Hyun; Bang, Duhee (2018-08-07). "Single-cell RNA sequencing technologies and bioinformatics pipelines". Experimental & Molecular Medicine. 50 (8): 96. doi:10.1038/s12276-018-0071-8. ISSN 2092-6413. PMC 6082860. PMID 30089861.
  3. ^ Stegle, Oliver; Teichmann, Sarah A.; Marioni, John C. (2015-01-28). "Computational and analytical challenges in single-cell transcriptomics". Nature Reviews Genetics. 16 (3): 133–145. doi:10.1038/nrg3833. ISSN 1471-0056. PMID 25628217.
  4. ^ a b c Cannoodt, Robrecht; Saelens, Wouter; Saeys, Yvan (2016-10-19). "Computational methods for trajectory inference from single-cell transcriptomics". European Journal of Immunology. 46 (11): 2496–2506. doi:10.1002/eji.201646347. ISSN 0014-2980. PMID 27682842.
  5. ^ a b Trapnell, Cole; Cacchiarelli, Davide; Grimsby, Jonna; Pokharel, Prapti; Li, Shuqiang; Morse, Michael; Lennon, Niall J; Livak, Kenneth J; Mikkelsen, Tarjei S (2014-03-23). "The dynamics and regulators of cell fate decisions are revealed by pseudotemporal ordering of single cells". Nature Biotechnology. 32 (4): 381–386. doi:10.1038/nbt.2859. ISSN 1087-0156. PMC 4122333. PMID 24658644.
  6. ^ a b c d Saelens, Wouter; Cannoodt, Robrecht; Todorov, Helena; Saeys, Yvan (2018-03-05). "A comparison of single-cell trajectory inference methods: towards more accurate and robust tools". bioRxiv: 276907. doi:10.1101/276907.
  7. ^ Bang, Duhee; Lee, Ji Hyun; Hwang, Byungjin (2018-08-07). "Single-cell RNA sequencing technologies and bioinformatics pipelines". Experimental & Molecular Medicine. 50 (8): 96. doi:10.1038/s12276-018-0071-8. ISSN 2092-6413. PMC 6082860. PMID 30089861.
  8. ^ Conesa, Ana; Madrigal, Pedro; Tarazona, Sonia; Gomez-Cabrero, David; Cervera, Alejandra; McPherson, Andrew; Szcześniak, Michał Wojciech; Gaffney, Daniel J.; Elo, Laura L. (2016-01-26). "A survey of best practices for RNA-seq data analysis". Genome Biology. 17 (1): 13. doi:10.1186/s13059-016-0881-8. ISSN 1474-760X. PMC 4728800. PMID 26813401.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  9. ^ a b Yosef, Nir; Regev, Aviv; Wagner, Allon (November 2016). "Revealing the vectors of cellular identity with single-cell genomics". Nature Biotechnology. 34 (11): 1145–1160. doi:10.1038/nbt.3711. ISSN 1546-1696. PMC 5465644. PMID 27824854.
  10. ^ Cahan, Patrick; Tan, Yuqi; Kumar, Pavithra (2017-01-01). "Understanding development and stem cells using single cell-based analyses of gene expression". Development. 144 (1): 17–32. doi:10.1242/dev.133058. ISSN 1477-9129. PMC 5278625. PMID 28049689.
  11. ^ a b Street, Kelly; Risso, Davide; Fletcher, Russell B.; Das, Diya; Ngai, John; Yosef, Nir; Purdom, Elizabeth; Dudoit, Sandrine (2018-06-19). "Slingshot: cell lineage and pseudotime inference for single-cell transcriptomics". BMC Genomics. 19: 477. doi:10.1186/s12864-018-4772-0.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  12. ^ Gerdes, M. J.; Sevinsky, C. J.; Sood, A.; Adak, S.; Bello, M. O.; Bordwell, A.; Can, A.; Corwin, A.; Dinn, S. (2013-07-01). "Highly multiplexed single-cell analysis of formalin-fixed, paraffin-embedded cancer tissue". Proceedings of the National Academy of Sciences. 110 (29): 11982–11987. doi:10.1073/pnas.1300136110. ISSN 0027-8424. PMC 3718135. PMID 23818604.
  13. ^ Lau, Ken S.; Coffey, Robert J.; Gerdes, Michael J.; Liu, Qi; Franklin, Jeffrey L.; Roland, Joseph T.; Ping, Jie; Simmons, Alan J.; McKinley, Eliot T. (2018-01-24). "Unsupervised Trajectory Analysis of Single-Cell RNA-Seq and Imaging Data Reveals Alternative Tuft Cell Origins in the Gut". Cell Systems. 6 (1): 37–51.e9. doi:10.1016/j.cels.2017.10.012. ISSN 2405-4712. PMC 5799016. PMID 29153838.
  14. ^ Ji, Zhicheng; Ji, Hongkai (2016-05-13). "TSCAN: Pseudo-time reconstruction and evaluation in single-cell RNA-seq analysis". Nucleic Acids Research. 44 (13): e117. doi:10.1093/nar/gkw430. ISSN 0305-1048. PMC 4994863. PMID 27179027.
  15. ^ Bendall, Sean C.; Davis, Kara L.; Amir, El-ad David; Tadmor, Michelle D.; Simonds, Erin F.; Chen, Tiffany J.; Shenfeld, Daniel K.; Nolan, Garry P.; Pe'Er, Dana (2014-04-24). "Single-Cell Trajectory Detection Uncovers Progression and Regulatory Coordination in Human B Cell Development". Cell. 157 (3): 714–725. doi:10.1016/j.cell.2014.04.005. ISSN 0092-8674. PMC 4045247. PMID 24766814. {{cite journal}}: no-break space character in |first1= at position 5 (help); no-break space character in |first2= at position 5 (help); no-break space character in |first3= at position 6 (help); no-break space character in |first4= at position 9 (help); no-break space character in |first5= at position 5 (help); no-break space character in |first6= at position 8 (help); no-break space character in |first7= at position 7 (help); no-break space character in |first8= at position 6 (help)
  16. ^ Setty, Manu; Tadmor, Michelle D; Reich-Zeliger, Shlomit; Angel, Omer; Salame, Tomer Meir; Kathail, Pooja; Choi, Kristy; Bendall, Sean; Friedman, Nir (2016-05-02). "Wishbone identifies bifurcating developmental trajectories from single-cell data". Nature Biotechnology. 34 (6): 637–645. doi:10.1038/nbt.3569. ISSN 1087-0156. PMC 4900897. PMID 27136076.
  17. ^ Shin, Jaehoon; Berg, Daniel A.; Zhu, Yunhua; Shin, Joseph Y.; Song, Juan; Bonaguidi, Michael A.; Enikolopov, Grigori; Nauen, David W.; Christian, Kimberly M.; Ming, Guo-li; Song, Hongjun (2015-09-03). "Single-Cell RNA-Seq with Waterfall Reveals Molecular Cascades underlying Adult Neurogenesis". Cell Stem Cell. 17 (3): 360–372. doi:10.1016/j.stem.2015.07.013. ISSN 1934-5909. PMID 26299571. {{cite journal}}: no-break space character in |first2= at position 7 (help); no-break space character in |first4= at position 7 (help); no-break space character in |first6= at position 8 (help); no-break space character in |first8= at position 6 (help); no-break space character in |first9= at position 9 (help)

External links

Retrieved from "https://en.wikipedia.org/w/index.php?title=Trajectory_inference&oldid=892930456"