CALISTA

Will generate a trajectory using CALISTA.

This method was wrapped inside a container. The original code of this method is available here.

ti_calista(runs = 50L, max_iter = 100L)

Arguments

runs

Number of independent runs of greedy algorithm. Domain: U(20, 100). Default: 50. Format: integer.
max_iter

Number of iterations in greedy algorithm. Domain: U(20, 400). Default: 100. Format: integer.

Value

A TI method wrapper to be used together with infer_trajectory

References

Papili Gao, N., Hartmann, T., Fang, T., Gunawan, R., 2018. CALISTA: Clustering And Lineage Inference in Single-Cell Transcriptional Analysis.