getFRmat and are dependent on the number of random draws as well as the size
of each random sample. For every cell population pair comparison, we take the median of the FR statistics
across all random samples as the estimated similarity. Parallel computing is used to minimize the runtime
of the algorithm (Visualize minimum spanning tree (MST) of the pooled data combined from the two cell populations. MST is the basis of the FR statistics. Two populations are similar if their respective events congregate with events of the same population membership. Runs is calculated as the number of edges connecting nodes of different cell population membership plus 1 ( (or equivalently, the number of subtrees of homogeneous cell population membership).
getFRest(XX1, XX2, sampleMethod = "proportional", sampleSize = 200,
estStat = "median", ndraws = 200, ncores = NULL)makeFRMST(mat, node.colors = c("blue", "red"))
runsmat a matrix of estimated runs for each XX1 by XX2 population comparisons.
mumat a matrix of estimated expected number of runs for each XX1 by XX2 population comparisons.
sigma2mat a matrix of estimated variance of runs for each XX1 by XX2 population comparisons.
pNormat a matrix of one-sided p-values of the estimated FR statistic for each XX1 by XX2 population comparisons under the asymptotic normality assumption of the FR statistic.
g an igraph object that contains graph adjacency matrix of the minimum spanning tree calculated from euclidean distance between nodes in the pooled data combined from the two cell populations.
gall an igraph object that contains graph adjacency matrix containing euclidean distance between nodes in the pooled data from the two cell population. Complete graph is assumed here.
ww FR statistics for the cell population comparison (formula: (runs-mu)/sqrt(sigma2))
runs observed number of runs for the cell population comparison
mu expected number of runs for the cell population comparison
sigma2 variance of runs for the cell population comparison
pNorm p-value of the FR statistic for the cell population comparison
distmat a matrix defining Euclidean distance between events (nodes) across the two cell populations
mstree minimum spannin tree defined in an adjacency matrix. 1 indicates an edge between nodes and 0 indicates non-existent edge.
C number of edge pairs (pairs of edges that share a common node) in the minumum spanning tree
m number of events in the first cell population
n number of events in the second cell population
## see vignettes
## see vignettesRun the code above in your browser using DataLab