Single-cell mapping of gene expression landscapes and lineage in the zebrafish embryo
估计阅读时长: 4 分钟

Assembles a manifold that is defined through a series of overlapping, locally-defined PCA subspaces.

  1. Non-mutual k-nearest-neighborhoods are first obtained for each cell in timepoint i. Neighbor edges are queried from timepoints i (within-timepoint edges) and i-1 (link edges) after projecting into a PCA subspace defined by all cells from timepoint i.
  2. Outgoing edges are then subject to local and global neighborhood restictions.
  3. The graph is restricted to mutual edges.

Fig. 2. Single-cell graph reveals a continuous developmental landscape of cell states. (A) Overview of graph construction strategy, and a force-directed layout of the resulting single-cell graph (nodes colored by collection timepoint). For each cell, up to 20 within- or between-timepoint mutual nearest neighbor edges are retained. (B) Single-cell graph, colored by germ layer identities inferred from differentially expressed marker genes (see table S2). (C) Single-cell graphs, colored by log10 expression counts for indicated cell type-specific marker genes.

A single-cell graph of cell state progression in the developing zebrafish embryo

We sought to map trajectories of cell state during develop-ment by linking cell states across time. Several computational approaches exist to infer orderings of asynchronous pro-cesses from scRNA-seq data (9–11), typically by projecting all cells into a single low-dimensional latent space. Such strategies may be illsuited to map gene expression in developing embryos, which exhibit dramatically increasing cell state di-mensionality and continuous changes in the sets and num-bers of cell state-defining genes (fig. S2, D and E).

To overcome these obstacles, we developed a graph-based strategy for locally embedding consecutive timepoints on the basis of biological variation that they share, rather than using a global coordinate system for all timepoints.

  1. This approach first constructs a single-cell k-nearest-neighbor graph for each timepoint ti, with nodes representing cells and edges linking neighbors in a low-dimensional subspace;
  2. it then joins the graphs by identifying neighboring cells in pairs of adjacent time points, using a coordinate system learned from the future (ti+1) timepoint (see methods).
  3. The resulting graph spans all time points, and allows application of formal graph-based methods for data analysis.

Single-cell mapping of gene expression landscapes and lineage in the zebrafish embryo. Wagner DE, Weinreb C, Collins ZM, Briggs JA, Megason SG, Klein AM. Science 26 Apr 2018. doi:10.1126/science.aar4362

Attachments

One response

Leave a Reply

Your email address will not be published. Required fields are marked *

博客文章
May 2023
S M T W T F S
 123456
78910111213
14151617181920
21222324252627
28293031  
  1. […] 在上面所提到的线性变化转换过程,其实就是一个热图绘制的过程。我们一般按照不同的颜色谱做线性变换映射,就可以得到对应的不同颜色系列下的NRRD热图成像渲染结果。对于NRRD图像文件的热图成像渲染原理,其实是和质谱成像的渲染原理一摸一样的(对于质谱成像渲染而言,其主要的原理也就是将对应的扫描点上的目标离子的intensity值取出,构建出一个和NRRD文件中的光栅矩阵数据一摸一样的矩阵数据,基于这个矩阵数据进行线性变换映射到对应的颜色值完成热图成像可视化操作)。 […]

  2. […] 如果我们需要将得到光栅矩阵数据进行可视化,该怎样做呢?其实,如果我们了解过热图成像或者质谱成像的原理的话,实际上对于这个光栅矩阵的原始数据进行成像的原理应该就会很清楚了。在我们拿到这个矩阵之后,可以将矩阵的行和列看作为二维图像空间之中的x和y坐标信息,然后对应的矩阵中的单元格值可以映射为一个对应的颜色,即可将从NRRD文件之中拿到的光栅矩阵数据给可视化出来。将光栅矩阵中的数值映射为对应的颜色值的方法原理,大家可以参考一下《【热图数据可视化】颜色插值计算原理》的内容介绍,一摸一样。 […]