Normalization of Chromosome Contact Maps: Matrix Balancing and Visualization

2021 ◽  
pp. 1-15
Author(s):  
Cyril Matthey-Doret ◽  
Lyam Baudry ◽  
Shogofa Mortaza ◽  
Pierrick Moreau ◽  
Romain Koszul ◽  
...  
2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Anastasia Ryzhkova ◽  
Alena Taskina ◽  
Anna Khabarova ◽  
Veniamin Fishman ◽  
Nariman Battulin

AbstractGeneration of mature red blood cells, consisting mainly of hemoglobin, is a remarkable example of coordinated action of various signaling networks. Chromatin condensation is an essential step for terminal erythroid differentiation and subsequent nuclear expulsion in mammals. Here, we profiled 3D genome organization in the blood cells from ten species belonging to different vertebrate classes. Our analysis of contact maps revealed a striking absence of such 3D interaction patterns as loops or TADs in blood cells of all analyzed representatives. We also detect large-scale chromatin rearrangements in blood cells from mammals, birds, reptiles and amphibians: their contact maps display strong second diagonal pattern, representing an increased frequency of long-range contacts, unrelated to TADs or compartments. This pattern is completely atypical for interphase chromosome structure. We confirm that these principles of genome organization are conservative in vertebrate erythroid cells.


Algorithms ◽  
2009 ◽  
Vol 2 (1) ◽  
pp. 76-92 ◽  
Author(s):  
Pietro Di Lena ◽  
Marco Vassura ◽  
Luciano Margara ◽  
Piero Fariselli ◽  
Rita Casadio

2014 ◽  
Vol 14 ◽  
pp. 357-362 ◽  
Author(s):  
Tony C.Y. Kuo ◽  
Janice Glasgow
Keyword(s):  

PLoS ONE ◽  
2018 ◽  
Vol 13 (5) ◽  
pp. e0196993
Author(s):  
Monika Kurczynska ◽  
Malgorzata Kotulska

Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2379
Author(s):  
Ibrahim Salim ◽  
A. Hamza

We present a geometric framework for surface denoising using graph signal processing, which is an emerging field that aims to develop new tools for processing and analyzing graph-structured data. The proposed approach is formulated as a constrained optimization problem whose objective function consists of a fidelity term specified by a noise model and a regularization term associated with prior data. Both terms are weighted by a normalized mesh Laplacian, which is defined in terms of a data-adaptive kernel similarity matrix in conjunction with matrix balancing. Minimizing the objective function reduces it to iteratively solve a sparse system of linear equations via the conjugate gradient method. Extensive experiments on noisy carpal bone surfaces demonstrate the effectiveness of our approach in comparison with existing methods. We perform both qualitative and quantitative comparisons using various evaluation metrics.


2001 ◽  
Vol 14 (11) ◽  
pp. 835-843 ◽  
Author(s):  
Piero Fariselli ◽  
Osvaldo Olmea ◽  
Alfonso Valencia ◽  
Rita Casadio

Sign in / Sign up

Export Citation Format

Share Document