PalantirKernel(adata, backward=False, time_key='dpt_pseudotime', compute_cond_num=False, check_connectivity=False)¶
Kernel which computes transition probabilities in a similar way to Palantir, see [Setty19].
Palantir computes a KNN graph in gene expression space and a pseudotime, which it then uses to direct the edges of the KNN graph, such that they are more likely to point into the direction of increasing pseudotime. To avoid disconnecting the graph, it does not remove all edges that point into the direction of decreasing pseudotime but keeps the ones that point to nodes inside a close radius. This radius is chosen according to the local density.
The implementation presented here won’t exactly reproduce the original Palantir algorithm (see below) but the results are qualitatively very similar.
Annotated data object.
Direction of the process.
Condition number of the transition matrix.
Get the kernels of the kernel expression, except for constants.
Parameters which are used to compute the transition matrix.
Pseudotemporal ordering of cells.
Return row-normalized transition matrix.
Compute transition matrix based on KNN graph and pseudotemporal ordering.
Return a copy of self.
Deserialize self from a file.
Serialize self to a file.
Write the transition matrix and parameters used for computation to the underlying