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

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

谢桂纲
Latest posts by 谢桂纲 (see all)

Attachments

One response

Leave a Reply

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

博客文章
June 2025
S M T W T F S
1234567
891011121314
15161718192021
22232425262728
2930  
  1. […] 在上面的工具调用消息数据结构中,我们可以清楚的看见有需要进行调用的工具名称,以及参数列表。当我们拿到这样子的调用信息后,就可以基于一定的规则找到需要执行的运行时中的函数来完成功能的实现。对于.NET平台上,我们一般是使用自定义属性加反射操作来解析相关的名称绑定结果。在.NET平台上对于这样子的一个根据调用信息来进行运行时解析和调用的方法,可以稍微参考《【Darwinism】Linux平台上的VisualBasic高性能并行计算应用的开发》的反射代码方法。 […]