Back

Intrinsic linking of chromatin fiber in human cells

Borodzik, M.; Denkiewicz, M.; Spalinski, K.; Winnicka Sztachelska, K.; Sengupta, K.; Pilipczuk, M.; Pilipczuk, M.; Ruan, Y.; Plewczynski, D.

2022-07-14 genomics
10.1101/2022.07.13.499767 bioRxiv
Show abstract

MotivationWe propose a practical algorithm based on graph theory, with the purpose of identifying CTCF-mediated chromatin loops that are linked in 3D space. Our method is based finding clique minors in graphs constructed from pairwise chromatin interaction data obtained from the ChIA-PET experiments. We show that such a graph structure, representing a particular arrangement of loops, mathematically necessitates linking, if co-occurring in an individual cell. The presence of these linked structures can advance our understanding of the principles of spatial organization of the genome. ResultsWe apply our method to graphs created from in situ ChIA-PET data for GM12878, H1ESC, HFFC6 and WTC11 cell lines, and from long-read ChIA-PET data. We look at these datasets as divided into CCDs - closely interconnected regions defined based on CTCF loops. We find numerous candidate regions with minors, indicating the presence of links. The graph-theoretic characteristics of these linked regions, including betweenness and closeness centrality, differ from regions without, in which no minors were found, which supports their non-random nature. We also look at the position of the linked regions with respect to chromatin compartments. AvailabilityThe implementation of the algorithm is available at https://github.com/SFGLab/cKNOTs ContactDariusz.Plewczynski@pw.edu.pl

Matching journals

The top 6 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.