library(miloR) library(SingleCellExperiment) library(scater) library(scran) library(dplyr) library(patchwork)
Milo is a tool for analysis of complex single cell datasets generated from replicated multi-condition experiments, which detects changes in composition between conditions. While differential abundance (DA) is commonly quantified in discrete cell clusters, Milo uses partially overlapping neighbourhoods of cells on a KNN graph. Starting from a graph that faithfully recapitulates the biology of the cell population, Milo analysis consists of 3 steps:
In this vignette we will elaborate on how these steps are implemented in the
For this demo we will use a synthetic dataset simulating a developmental trajectory, generated using dyntoy.
data("sim_trajectory", package = "miloR") ## Extract SingleCellExperiment object traj_sce <- sim_trajectory[['SCE']] ## Extract sample metadata to use for testing traj_meta <- sim_trajectory[["meta"]] ## Add metadata to colData slot colData(traj_sce) <- DataFrame(traj_meta)
For DA analysis we need to construct an undirected KNN graph of single-cells. Standard single-cell analysis pipelines usually do this from distances in PCA. We normalize and calculate principal components using
scater. I also run UMAP for visualization purposes.
logcounts(traj_sce) <- log(counts(traj_sce) + 1) traj_sce <- runPCA(traj_sce, ncomponents=30) traj_sce <- runUMAP(traj_sce) plotUMAP(traj_sce)
For differential abundance analysis on graph neighbourhoods we first construct a
Milo object. This extends the
SingleCellExperiment class to store information about neighbourhoods on the KNN graph.
Milo constructor takes as input a
traj_milo <- Milo(traj_sce) reducedDim(traj_milo, "UMAP") <- reducedDim(traj_sce, "UMAP") traj_milo
## class: Milo ## dim: 500 500 ## metadata(0): ## assays(2): counts logcounts ## rownames(500): G1 G2 ... G499 G500 ## rowData names(0): ## colnames: NULL ## colData names(5): cell_id group_id Condition Replicate Sample ## reducedDimNames(2): PCA UMAP ## mainExpName: NULL ## altExpNames(0): ## nhoods dimensions(2): 1 1 ## nhoodCounts dimensions(2): 1 1 ## nhoodDistances dimension(1): 0 ## graph names(0): ## nhoodIndex names(1): 0 ## nhoodExpression dimension(2): 1 1 ## nhoodReducedDim names(0): ## nhoodGraph names(0): ## nhoodAdjacency dimension(2): 1 1
We can use the
zellkonverter package to make a
SingleCellExperiment object from an
AnnData object stored as
library(zellkonverter) # Obtaining an example H5AD file. example_h5ad <- system.file("extdata", "krumsiek11.h5ad", package = "zellkonverter") example_h5ad_sce <- readH5AD(example_h5ad) example_h5ad_milo <- Milo(example_h5ad_sce)
Seurat package includes a converter to
library(Seurat) data("pbmc_small") pbmc_small_sce <- as.SingleCellExperiment(pbmc_small) pbmc_small_milo <- Milo(pbmc_small_sce)
We need to add the KNN graph to the Milo object. This is stored in the
graph slot, in
igraph format. The
miloR package includes functionality to build and store the graph from the PCA dimensions stored in the
traj_milo <- buildGraph(traj_milo, k = 10, d = 30)
## Constructing kNN graph with k:10
In progress: we are perfecting the functionality to add a precomputed KNN graph (for example constructed with Seurat or scanpy) to the
graph slot using the adjacency matrix.
We define the neighbourhood of a cell, the index, as the group of cells connected by an edge in the KNN graph to the index cell. For efficiency, we don’t test for DA in the neighbourhood of every cell, but we sample as indices a subset of representative cells, using a KNN sampling algorithm used by Gut et al. 2015.
For sampling you need to define a few parameters:
prop: the proportion of cells to randomly sample to start with (usually 0.1 - 0.2 is sufficient)
k: the k to use for KNN refinement (we recommend using the same k used for KNN graph building)
d: the number of reduced dimensions to use for KNN refinement (we recommend using the same d used for KNN graph building)
refinedindicated whether you want to use the sampling refinement algorithm, or just pick cells at random. The default and recommended way to go is to use refinement. The only situation in which you might consider using random instead, is if you have batch corrected your data with a graph based correction algorithm, such as BBKNN, but the results of DA testing will be suboptimal.
traj_milo <- makeNhoods(traj_milo, prop = 0.1, k = 10, d=30, refined = TRUE)
## Checking valid object
## Running refined sampling with reduced_dim
## Warning in .refined_sampling(random_vertices, X_reduced_dims, k): Rownames not ## set on reducedDims - setting to row indices
Once we have defined neighbourhoods, it’s good to take a look at how big the neighbourhoods are (i.e. how many cells form each neighbourhood). This affects the power of DA testing. We can check this out using the
plotNhoodSizeHist function. Empirically, we found it’s best to have a distribution peaking between 50 and 100. Otherwise you might consider rerunning
prop (here the distribution looks ludicrous because it’s a small dataset).
Now we have to count how many cells from each sample are in each neighbourhood. We need to use the cell metadata and specify which column contains the sample information.
traj_milo <- countCells(traj_milo, meta.data = data.frame(colData(traj_milo)), samples="Sample")
## Checking meta.data validity
## Counting cells in neighbourhoods
This adds to the
Milo object a
n \times m matrix, where n is the number of neighbourhoods and \(m\) is the number of experimental samples. Values indicate the number of cells from each sample counted in a neighbourhood. This count matrix will be used for DA testing.
## 6 x 6 sparse Matrix of class "dgCMatrix" ## B_R1 A_R1 A_R2 B_R2 B_R3 A_R3 ## 1 8 . . 14 28 1 ## 2 7 6 5 11 16 3 ## 3 15 . 1 22 29 1 ## 4 5 3 3 3 3 4 ## 5 2 1 . 3 10 3 ## 6 6 6 3 3 7 5
Now we are all set to test for differential abundance in neighbourhoods. We implement this hypothesis testing in a generalized linear model (GLM) framework, specifically using the Negative Binomial GLM implementation in
We first need to think about our experimental design. The design matrix should match samples to a condition of interest. In this case the
Condition is the covariate we are going to test for.
traj_design <- data.frame(colData(traj_milo))[,c("Sample", "Condition")] traj_design <- distinct(traj_design) rownames(traj_design) <- traj_design$Sample ## Reorder rownames to match columns of nhoodCounts(milo) traj_design <- traj_design[colnames(nhoodCounts(traj_milo)), , drop=FALSE] traj_design
## Sample Condition ## B_R1 B_R1 B ## A_R1 A_R1 A ## A_R2 A_R2 A ## B_R2 B_R2 B ## B_R3 B_R3 B ## A_R3 A_R3 A
Milo uses an adaptation of the Spatial FDR correction introduced by cydar, which accounts for the overlap between neighbourhoods. Specifically, each hypothesis test P-value is weighted by the reciprocal of the kth nearest neighbour distance. To use this statistic we first need to store the distances between nearest neighbors in the Milo object.
traj_milo <- calcNhoodDistance(traj_milo, d=30)
Now we can do the test, explicitly defining our experimental design.
rownames(traj_design) <- traj_design$Sample da_results <- testNhoods(traj_milo, design = ~ Condition, design.df = traj_design)
## Using TMM normalisation
## Performing spatial FDR correction withk-distance weighting
This calculates a Fold-change and corrected P-value for each neighbourhood, which indicates whether there is significant differential abundance between conditions.
da_results %>% arrange(- SpatialFDR) %>% head()
## logFC logCPM F PValue FDR Nhood SpatialFDR ## 19 0.01880599 15.41161 0.001386078 0.9731932 0.9731932 19 0.9731932 ## 9 -0.25556996 15.71117 0.266199971 0.6069875 0.6312670 9 0.6311887 ## 11 -0.32274234 15.44814 0.471935719 0.5503505 0.5962130 11 0.5957746 ## 4 -0.58821834 15.17063 0.605934505 0.4380901 0.4952323 4 0.4954764 ## 15 0.39376174 15.95905 1.174088971 0.3807867 0.4500207 15 0.4486690 ## 6 -0.54039326 15.51855 1.356294066 0.2979098 0.3688407 6 0.3672821
To visualize DA results, we build an abstracted graph of neighbourhoods that we can superimpose on the single-cell embedding.
traj_milo <- buildNhoodGraph(traj_milo) plotUMAP(traj_milo) + plotNhoodGraphDA(traj_milo, da_results, alpha=0.05) + plot_layout(guides="collect")