#18 · Single-cell
Explicit objectives now guide single-cell lineage inference and clustering resolution
The three items share a design principle: each method names its optimization target directly instead of relying on implicit heuristics. The preprint models each cell type as an affine subspace defined by linear transcriptome constraints, a geometric account of cell identity benchmarked on simulated data. Carta infers optimal cell differentiation maps from single-cell lineage tracing data by balancing map complexity against unobserved transitions. CANTAO uses average overlap to compare ranked differentially expressed gene lists, using that metric to guide clustering resolution and annotation in scRNA-seq. What is new is less any single algorithm than the choice of criterion as the central object: a geometric constraint, a complexity penalty, or a rank-overlap metric.
Published papers
Inferring cell differentiation maps from lineage tracing data.
Carta, a new algorithm that infers optimal cell differentiation maps from single-cell lineage tracing data by balancing map complexity against unobserved…
CANTAO: guiding clustering and annotation in single-cell RNA sequencing using average overlap.
CANTAO introduces the average overlap metric to compare ranked differentially expressed gene lists for guiding clustering resolution and annotation of…
Preprints
Subspace clustering identifies transcriptome constraints determining cell type identity
Proposes a subspace clustering algorithm for scRNA-seq that models each cell type as an affine subspace of linear constraints, benchmarked on simulated and C.…
Topic history
| Date | Rank |
|---|---|
| #18 | |
| #34 | |
| #11 | |
| #20 | |
| #7 | |
| #3 | |
| #3 | |
| #3 | |
| #2 | |
| #2 | |
| #5 | |
| #2 | |
| #16 | |
| #27 | |
| #17 | |
| #25 | |
| #16 | |
| #16 | |
| #12 |