2017
DOI: 10.1093/bioinformatics/btx173
|View full text |Cite
|
Sign up to set email alerts
|

TASIC: determining branching models from time series single cell data

Abstract: Supplementary data are available at Bioinformatics online.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 35 publications
(30 citation statements)
references
References 30 publications
0
30
0
Order By: Relevance
“…Its successor, Monocle 2, uses a reversed graph embedding algorithm [5]. Other methods for scRNA-seq analysis use principal components analysis and hierarchical clustering (pcaReduce) [6], clustering based on approximate nearest neighbors (scmap) [7], biclustering (BackSpin) [8], a latent variable model (svLVM) [9], bifurcation analysis of a nearest neighbor graph (Wishbone) [10], a hidden Markov model coupled with probabilistic Kalman filtering (TASIC) [11], and a latent Dirichlet allocation model (cellTree) [12].…”
Section: Introductionmentioning
confidence: 99%
“…Its successor, Monocle 2, uses a reversed graph embedding algorithm [5]. Other methods for scRNA-seq analysis use principal components analysis and hierarchical clustering (pcaReduce) [6], clustering based on approximate nearest neighbors (scmap) [7], biclustering (BackSpin) [8], a latent variable model (svLVM) [9], bifurcation analysis of a nearest neighbor graph (Wishbone) [10], a hidden Markov model coupled with probabilistic Kalman filtering (TASIC) [11], and a latent Dirichlet allocation model (cellTree) [12].…”
Section: Introductionmentioning
confidence: 99%
“…The use of branching probabilities leads to lower likelihood for cell assignments to later (more specific) paths in the branching tree. This is similar to prior probabilistic methods for reconstructing branching trajectories (Rashid et al, 2017). The idea here is that earlier stages are often less specific (higher entropy (Teschendorff and Enver, 2017), while later stages (representing specific fates) have a tighter expression profile.…”
Section: Cshmm Model Formulationmentioning
confidence: 88%
“…Since the SPRING analysis provides a low dimensional dynamic representation implying branching trajectories, we next sought to fully reconstruct these putative branching points to study their regulation and to characterize the set of TFs and signalling pathways associated with their potentially bifurcating fates. For this, we extended our previously developed computational method based on Hidden Markov models (Ding et al, 2018;Rashid et al, 2017) so that it can continuously assign cells along trajectories while still being able to infer regulators controlling branching events. The new method relies on Continuous State Hidden Markov Models (CSHMM).…”
Section: A Continuous Branching Network Model Learns Predicts and Mamentioning
confidence: 99%