Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
View publication in the Research portal
View/Open full text file from the Research portal
Date
2022-02-28
Major/Subject
Mcode
Degree programme
Language
en
Pages
204–228
Series
SIAM Journal on Mathematics of Data Science, Volume 4, issue 1
Abstract
The spatial organization of the genome in the cell nucleus plays an important role for gene regulation, replication of the deoxyribonucleic acid (DNA), and genomic integrity. Through the development of chromosome conformation capture experiments (such as 3C, 4C, and Hi-C) it is now possible to obtain the contact frequencies of the DNA at the whole-genome level. In this paper, we study the problem of reconstructing the three-dimensional (3D) organization of the genome from such whole-genome contact frequencies. A standard approach is to transform the contact frequencies into noisy distance measurements and then apply semidefinite programming formulations to obtain the 3D configuration. However, neglected in such reconstructions is the fact that most eukaryotes including humans are diploid and therefore contain two copies of each genomic locus. We prove that the 3D organization of the DNA is not identifiable from the distance measurements derived from contact frequencies in diploid organisms. In fact, there areinfinitely many solutions even in the noise-free setting. We then discuss various additional biologically relevant and experimentally measurable constraints (including distances between neighboring genomic loci and higher-order interactions) and prove identifiability under these conditions. Furthermore, we provide semidefinite programming formulations for computing the 3D embedding of the DNA with these additional constraints and show that we can recover the true 3D embedding with high accuracy from both noiseless and noisy measurements. Finally, we apply our algorithm to real pairwise and higher-order contact frequency data and show that we can recover known genome organization patterns.Description
| openaire: EC/H2020/748354/EU//NonnegativeRank
Keywords
3D genome organization, diploid organisms, semidefinite programming, Hi-C, Euclidean distance geometry, systems of polynomial equations
Other note
Citation
Belyaeva , A , Kubjas , K , Sun , L J & Uhler , C 2022 , ' Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry ' , SIAM Journal on Mathematics of Data Science , vol. 4 , no. 1 , pp. 204–228 . https://doi.org/10.1137/21M1390372
