Friday, January 12, 2024

<< >>  
2023. 12
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
2024. 1
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
2024. 2
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
2024-01-17 / 11:00 ~ 12:00
IBS-KAIST 세미나 - 수리생물학: 인쇄
by 김준일(숭실대학교)
Reconstruction of gene regulatory networks (GRNs) is a powerful approach to capture a prioritized gene set controlling cellular processes. In our previous study, we developed TENET a GRN reconstructor from single cell RNA sequencing (scRNAseq). TENET has a superior capability to identify key regulators compared with other algorithms. However, accurate inference of gene regulation is still challenging. Here, we suggest an integrative strategy called TENET+ by combining single cell transcriptome and chromatin accessibility data. TENET+ predicts target genes and open chromatin regions associated with transcription factors (TFs) and links the target regions to their corresponding target gene. As a result, TENET+ can infer regulatory triplets of TF, target gene, and enhancer. By applying TENET+ to a paired scRNAseq and scATACseq dataset of human peripheral blood mononuclear cells, we found critical regulators and their epigenetic regulations for the differentiations of CD4 T cells, CD8 T cells, B cells and monocytes. Interestingly, not only did TENET+ predict several top regulators of each cell type which were not predicted by the motif-based tool SCENIC, but we also found that TENET+ outperformed SCENIC in prioritizing critical regulators by using a cell type associated gene list. Furthermore, utilizing and modeling regulatory triplets, we can infer a comprehensive epigenetic GRN. In sum, TENET+ is a tool predicting epigenetic gene regulatory programs for various types of datasets in an unbiased way, suggesting that novel epigenetic regulations can be identified by TENET+.
2024-01-16 / 16:30 ~ 17:30
IBS-KAIST 세미나 - 이산수학: Average flat-size in complex-representable matroids 인쇄
by Matthew Kroeker(University of Waterloo)
Melchior’s Inequality (1941) implies that, in a rank-3 real-representable matroid, the average number of points in a line is less than three. This was extended to the complex-representable matroids by Hirzebruch in 1983 with the slightly weaker bound of four. In this talk, we discuss and sketch the proof of the recent result that, in a rank-4 complex-representable matroid which is not the direct-sum of two lines, the average number of points in a plane is bounded above by an absolute constant. Consequently, the average number of points in a flat in a rank-4 complex-representable matroid is bounded above by an absolute constant. Extensions of these results to higher dimensions will also be discussed. In particular, the following quantities are bounded in terms of k and r respectively: the average number of points in a rank-k flat in a complex-representable matroid of rank at least 2k-1, and the average number of points in a flat in a rank-r complex-representable matroid. Our techniques rely on a theorem of Ben Lund which approximates the number of flats of a given rank. This talk is based on joint work with Rutger Campbell and Jim Geelen.
Events for the 취소된 행사 포함 모두인쇄
export to Google calendar  .ics download