Friday, April 4, 2025

<< >>  
2025. 3
Sun Mon Tue Wed Thu Fri Sat
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31
2025. 4
Sun Mon Tue Wed Thu Fri Sat
1 2 3 4 5
6 7 8 9 10 11 12
13 14 15 16 17 18 19
20 21 22 23 24 25 26
27 28 29 30
2025. 5
Sun Mon Tue Wed Thu Fri Sat
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30 31
2025-04-04 / 11:00 ~ 12:00
IBS-KAIST 세미나 - IBS-KAIST 세미나: 인쇄
by ()
The advent of single-cell transcriptomics has brought a greatly improved understanding of the heterogeneity of gene expression across cell types, with important applications in developmental biology and cancer research. Single-cell RNA sequencing datasets, which are based on tags called universal molecular identifiers, typically include a large number of zeroes. For such datasets, genes with even moderate expression may be poorly represented in sequencing count matrices. Standard pipelines often retain only a small subset of genes for further analysis, but we address the problem of estimating relative expression across the entire transcriptome by adopting a multivariate lognormal Poisson count model. We propose empirical Bayes estimation procedures to estimate latent cell-cell correlations, and to recover meaningful estimates for genes with low expression. For small groups of cells, an important sampling procedure uses the full cell-cell correlation structure and is computationally feasible. For larger datasets, we propose a gene-level shrinkage procedure that has favorable performance for datasets with approximately compound symmetric cell-cell correlation. A fast procedure that incorporates matrix approximations is also promising, and extensible to very large datasets. We apply our approaches to simulated and real datasets, and demonstrate favorable performance in comparisons to competing normalization approaches. We further illustrate the applications of our approach in downstream analyses, including cell-type clustering and identification.
2025-04-08 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: A Minor Characterisation of Normally Spanned Sets of Vertices 인쇄
by Nicola Lorenz()
A rooted spanning tree of a graph $G$ is called normal if the endvertices of all edges of $G$ are comparable in the tree order. It is well known that every finite connected graph has a normal spanning tree (also known as depth-first search tree). Also, all countable graphs have normal spanning trees, but uncountable complete graphs for example do not. In 2021, Pitz proved the following characterisation for graphs with normal spanning trees, which had been conjectured by Halin: A connected graph $G$ has a normal spanning tree if and only if every minor of $G$ has countable colouring number, i.e. there is a well-order of the vertices such that every vertex is preceded by only finitely many of its neighbours. More generally, a not necessarily spanning tree in $G$ is called normal if for every path $P$ in $G$ with both endvertices in $T$ but no inner vertices in $T$, the endvertices of $P$ are comparable in the tree order. We establish a local version of Pitz’s theorem by characterising for which sets $U$ of vertices of $G$ there is a normal tree in $G$ covering $U$. The results are joint work with Max Pitz.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download