# More controls for the tests used in the condiments workflow

This vignette is made for users that are already familiar with the basic condiments workflow described in the first vignette. Here, we will show how to modify the default parameters for the first two steps of the workflow

    # For analysis
    library(condiments)
    library(slingshot)
    set.seed(21)

# Toy dataset

We rely on the same toy dataset as the first vignette

    data("toy_dataset", package = "condiments")
    df <- toy_dataset$sd
    rd <- as.matrix(df[, c("Dim1", "Dim2")])
    sds <- slingshot(rd, df$cl)

# The topologyTest function

By default, the topologyTest function requires only two inputs, the `sds` object and the `condition` labels. To limit run time for the vignette, we also change the default number of permutations used to generate trajectories under the null by setting the `rep` argument to \(10\) instead of the default \(100\). As such, the test statistics might be more variable.

    top_res <- topologyTest(sds = sds, conditions = df$conditions, rep = 10)

    ## Generating permuted trajectories

    ## Running KS-mean test

    knitr::kable(top_res)

method | thresh | statistic | p.value
--- | --- | --- | ---
KS_mean | 0.01 | 0 | 1

## Changing the method or the threshold

The topologyTest function can be relatively slow on large datasets. Moreover, when changing the method used to test the null hypothesis that a common trajectory should be fitted, the first permutation part of generating `rep` trajectories under the null is identical. Therefore, we allow users to specify more than one method and one value of the threshold. Here, we will use both the Kolmogorov-Smirnov test test(Smirnov 1939) and the classifier-test(Lopez-Paz and Oquab 2016).

    top_res <- topologyTest(sds = sds, conditions = df$conditions, rep = 10,
                            methods = c("KS_mean", "Classifier"),
                            threshs = c(0, .01, .05, .1))

    ## Generating permuted trajectories

    ## Running KS-mean test

    ## Running Classifier test

    knitr::kable(top_res)

method | thresh | statistic | p.value
--- | --- | --- | ---
KS_mean | 0 | 0.0070000 | 1.0000000
KS_mean | 0.01 | 0.0000000 | 1.0000000
KS_mean | 0.05 | 0.0000000 | 1.0000000
KS_mean | 0.1 | 0.0000000 | 1.0000000
Classifier | 0 | 0.4150000 | 0.9999821
Classifier | 0.01 | 0.3800000 | 1.0000000
Classifier | 0.05 | 0.3333333 | 1.0000000
Classifier | 0.1 | 0.2833333 | 1.0000000

To see all methods avaible, use /tmp/Rtmp20s7QG/Rinst1f8a2ab648ab/condiments/help/topologyTest and look at the `methods` argument.

## Passing arguments to the test method

For all methods but the KS test, additional paramters can be specified, using a custom argument: `args_classifier`, `args_wass` or `args_mmd`. See the help file for given test more information on those parameters. For example, since the default test based on the wasserstein distance and permutation test is quite slow, we can pass a `fast` argument.

    top_res <- topologyTest(sds = sds, conditions = df$conditions, rep = 10,
                            methods = "wasserstein_permutation",
                            args_wass = list(fast = TRUE, S = 100, iterations  = 10^2))

    ## Generating permuted trajectories

    ## Running wassertsein permutation test

    knitr::kable(top_res)

method | thresh | statistic | p.value
--- | --- | --- | ---
wasserstein_permutation | NA | 1.356861 | 0.85

## Using parallelisation

For now, the first part of the topologyTest has been designed for parallelisation using the BiocParallel package. For example, to run with 4 cores, you can run the following command

    library(BiocParallel)
    BPPARAM <- bpparam()
    BPPARAM$progressbar <- TRUE
    BPPARAM$workers <- 4
    top_res <- topologyTest(sds = sds, conditions = df$conditions, rep = 100,
                            parallel = TRUE, BPPARAM = BPPARAM)
    knitr::kable(top_res)

# Differential progression and fate selection

The tests for the second test are much less compute-intensive, therefore there is no parallelisation. However, the other changes introduce in the previous section are still possible

## Default

    prog_res <- progressionTest(sds, conditions = df$conditions)
    knitr::kable(prog_res)

lineage | statistic | p.value
--- | --- | ---
All | 5.504172 | 0

    dif_res <- fateSelectionTest(sds, conditions = df$conditions)

    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .
    ##
    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .

    knitr::kable(dif_res)

pair | statistic | p.value
--- | --- | ---
1vs2 | 0.6386486 | 1.9e-05

## Changing the method and / or threshold

    prog_res <- progressionTest(sds, conditions = df$conditions, method = "Classifier")
    knitr::kable(prog_res)

lineage | statistic | p.value
--- | --- | ---
All | 0.5890991 | 0.0043539

    dif_res <- fateSelectionTest(sds, conditions = df$conditions, thresh = .05)

    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .
    ##
    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .

    knitr::kable(dif_res)

pair | statistic | p.value
--- | --- | ---
1vs2 | 0.6121622 | 0.0004817

## Passing more parameters to the test methods

    prog_res <- progressionTest(sds, conditions = df$conditions, method = "Classifier",
                                args_classifier = list(method = "rf"))

    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range
    ## Warning in randomForest.default(x, y, mtry = param$mtry, ...): invalid mtry:
    ## reset to within valid range

    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .

    knitr::kable(prog_res)

lineage | statistic | p.value
--- | --- | ---
All | 0.517027 | 0.3192952

    dif_res <- fateSelectionTest(sds, conditions = df$conditions)

    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .
    ##
    ## note: only 1 unique complexity parameters in default grid. Truncating the grid to 1 .

    knitr::kable(dif_res)

pair | statistic | p.value
--- | --- | ---
1vs2 | 0.6611712 | 8e-07

# Conclusion

For all of the above procedures, it is important to note that we are making multiple comparisons. The p-values we obtain from these tests should be corrected for multiple testing, especially for trajectories with a large number of lineages.

That said, trajectory inference is often one of the last computational methods in a very long analysis pipeline (generally including gene-level quantification, gene filtering / feature selection, and dimensionality reduction). Hence, we strongly discourage the reader from putting too much faith in any p-value that comes out of this analysis. Such values may be useful suggestions, indicating particular features or cells for follow-up study, but should generally not be treated as meaningful statistical quantities.

If some commands and parameters are still unclear after going through this vignette, do not hesitate to open an issue on the condiments Github repository.

# Session Info

    sessionInfo()

    ## R version 4.6.0 (2026-04-24)
    ## Platform: x86_64-pc-linux-gnu
    ## Running under: Ubuntu 24.04.4 LTS
    ##
    ## Matrix products: default
    ## BLAS:   /usr/lib/x86_64-linux-gnu/openblas-pthread/libblas.so.3
    ## LAPACK: /usr/lib/x86_64-linux-gnu/openblas-pthread/libopenblasp-r0.3.26.so;  LAPACK version 3.12.0
    ##
    ## locale:
    ##  [1] LC_CTYPE=en_US.UTF-8       LC_NUMERIC=C
    ##  [3] LC_TIME=en_US.UTF-8        LC_COLLATE=en_US.UTF-8
    ##  [5] LC_MONETARY=en_US.UTF-8    LC_MESSAGES=en_US.UTF-8
    ##  [7] LC_PAPER=en_US.UTF-8       LC_NAME=C
    ##  [9] LC_ADDRESS=C               LC_TELEPHONE=C
    ## [11] LC_MEASUREMENT=en_US.UTF-8 LC_IDENTIFICATION=C
    ##
    ## time zone: Etc/UTC
    ## tzcode source: system (glibc)
    ##
    ## attached base packages:
    ## [1] stats4    stats     graphics  grDevices utils     datasets  methods
    ## [8] base
    ##
    ## other attached packages:
    ##  [1] caret_7.0-1                 lattice_0.22-9
    ##  [3] viridis_0.6.5               viridisLite_0.4.3
    ##  [5] RColorBrewer_1.1-3          ggplot2_4.0.3
    ##  [7] tidyr_1.3.2                 dplyr_1.2.1
    ##  [9] slingshot_2.21.0            TrajectoryUtils_1.21.0
    ## [11] SingleCellExperiment_1.35.1 SummarizedExperiment_1.43.0
    ## [13] Biobase_2.73.1              GenomicRanges_1.65.0
    ## [15] Seqinfo_1.3.0               IRanges_2.47.2
    ## [17] S4Vectors_0.51.3            BiocGenerics_0.59.6
    ## [19] generics_0.1.4              MatrixGenerics_1.25.0
    ## [21] matrixStats_1.5.0           princurve_2.1.6
    ## [23] condiments_1.21.0           knitr_1.51
    ## [25] rmarkdown_2.31
    ##
    ## loaded via a namespace (and not attached):
    ##   [1] sys_3.4.3                 jsonlite_2.0.0
    ##   [3] magrittr_2.0.5            spatstat.utils_3.2-3
    ##   [5] ggbeeswarm_0.7.3          farver_2.1.2
    ##   [7] vctrs_0.7.3               DelayedMatrixStats_1.35.0
    ##   [9] htmltools_0.5.9           S4Arrays_1.13.0
    ##  [11] BiocNeighbors_2.7.2       SparseArray_1.13.2
    ##  [13] pROC_1.19.0.1             sass_0.4.10
    ##  [15] parallelly_1.47.0         bslib_0.11.0
    ##  [17] plyr_1.8.9                lubridate_1.9.5
    ##  [19] cachem_1.1.0              buildtools_1.0.0
    ##  [21] igraph_2.3.1              lifecycle_1.0.5
    ##  [23] iterators_1.0.14          pkgconfig_2.0.3
    ##  [25] rsvd_1.0.5                Matrix_1.7-5
    ##  [27] R6_2.6.1                  fastmap_1.2.0
    ##  [29] future_1.70.0             digest_0.6.39
    ##  [31] scater_1.41.1             irlba_2.3.7
    ##  [33] beachmat_2.29.0           labeling_0.4.3
    ##  [35] randomForest_4.7-1.2      timechange_0.4.0
    ##  [37] abind_1.4-8               mgcv_1.9-4
    ##  [39] compiler_4.6.0            rngtools_1.5.2
    ##  [41] proxy_0.4-29              withr_3.0.2
    ##  [43] doParallel_1.0.17         S7_0.2.2
    ##  [45] BiocParallel_1.47.0       MASS_7.3-65
    ##  [47] lava_1.9.1                DelayedArray_0.39.3
    ##  [49] ModelMetrics_1.2.2.2      tools_4.6.0
    ##  [51] vipor_0.4.7               otel_0.2.0
    ##  [53] beeswarm_0.4.0            future.apply_1.20.2
    ##  [55] nnet_7.3-20               glue_1.8.1
    ##  [57] nlme_3.1-169              grid_4.6.0
    ##  [59] reshape2_1.4.5            recipes_1.3.2
    ##  [61] gtable_0.3.6              class_7.3-23
    ##  [63] data.table_1.18.4         BiocSingular_1.29.0
    ##  [65] ScaledMatrix_1.21.0       XVector_0.53.0
    ##  [67] ggrepel_0.9.8             RANN_2.6.2
    ##  [69] foreach_1.5.2             pillar_1.11.1
    ##  [71] stringr_1.6.0             limma_3.69.1
    ##  [73] Ecume_0.9.2               splines_4.6.0
    ##  [75] survival_3.8-6            tidyselect_1.2.1
    ##  [77] maketools_1.3.2           scuttle_1.23.1
    ##  [79] pbapply_1.7-4             transport_0.15-4
    ##  [81] gridExtra_2.3             xfun_0.57
    ##  [83] statmod_1.5.2             hardhat_1.4.3
    ##  [85] distinct_1.25.0           timeDate_4052.112
    ##  [87] stringi_1.8.7             yaml_2.3.12
    ##  [89] evaluate_1.0.5            codetools_0.2-20
    ##  [91] kernlab_0.9-33            tibble_3.3.1
    ##  [93] cli_3.6.6                 rpart_4.1.27
    ##  [95] jquerylib_0.1.4           Rcpp_1.1.1-1.1
    ##  [97] globals_0.19.1            spatstat.univar_3.2-0
    ##  [99] parallel_4.6.0            gower_1.0.2
    ## [101] doRNG_1.8.6.3             sparseMatrixStats_1.25.0
    ## [103] listenv_0.10.1            ipred_0.9-15
    ## [105] scales_1.4.0              prodlim_2026.03.11
    ## [107] e1071_1.7-17              purrr_1.2.2
    ## [109] rlang_1.2.0

# References

Lopez-Paz, David, and Maxime Oquab. 2016. “Revisiting Classifier Two-Sample Tests.” Arxiv, October, 1–15. http://arxiv.org/abs/1610.06545.
Smirnov, Nikolai V. 1939. “On the Estimation of the Discrepancy Between Empirical Curves of Distribution for Two Independent Samples.” Bull. Math. Univ. Moscou 2 (2): 3–14.