Pseudotime Ordering Algorithms
Pseudotime Ordering Algorithms is a computational methodology that infers the temporal progression of cells in a biological process by constructing a latent ordering from high-dimensional single-cell data based on transcriptional similarity, thereby enabling the reconstruction of dynamic trajectories in the absence of explicit time measurements.
8
Publications
1.2K
Citations
21
Authors
14
Institutions
Publications per year
2017–2026
4
Variants
Pseudotime Inference Algorithms
Parents
8
1–5 of 8
21
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 21
14
Genomics (United Kingdom)
Oxford, United Kingdom
2 h-index
4 publications
166 citations
University of Oxford
Oxford, United Kingdom
2 h-index
5 publications
188 citations
Åbo Akademi University
Turku, Finland
1 h-index
4 publications
72 citations
The Alan Turing Institute
London, United Kingdom
1 h-index
1 publications
15 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
3 publications
45 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
49 citations

Johns Hopkins University
Baltimore, United States
1 h-index
2 publications
1.4K citations
MRC Biostatistics Unit
Cambridge, United Kingdom
1 h-index
3 publications
45 citations
1–8 of 14
5 publications · 422 citations
5
h-index
Repository · 2 publications · 70 citations
2
h-index
1 publications · 716 citations
1
h-index
1–3