paper-with-me

Papers

Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry

2021-01-13 · Anastasiya Belyaeva, Kaie Kubjas, Lawrence J. Sun, Caroline Uhler

The spatial organization of the DNA in the cell nucleus plays an important role for gene regulation, DNA replication, and genomic integrity. Through the development of chromosome conformation capture experiments (such as 3C, 4C, 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 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 (SDP) 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 distance measurements derived from contact frequencies in diploid organisms. In fact, there are infinitely 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 SDP 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.

📄 PDF Abstract BibTeX arXiv:2101.05336

Code (1)

uhlerlab/diploid-3D-reconstruction 공식 구현

Similar Papers 제목 키워드 기반

Meraculous-2D: Haplotype-sensitive Assembly of Highly Heterozygous genomes

2017-03-29

While many short read assemblers attempt to simplify the de Brujin graph by identifying and resolving variant-induced bubbles to produce a haploid mosaic result, this approach is only viable when variants are relatively …

3D genome reconstruction from partially phased Hi-C data

2023-01-27 · Diego Cifuentes, Jan Draisma, Oskar Henriksson, Annachiara Korchmaros 외

The 3-dimensional (3D) structure of the genome is of significant importance for many cellular processes. In this paper, we study the problem of reconstructing the 3D structure of chromosomes from Hi-C data of diploid org…

3D Reconstruction

Matrix Completion and Performance Guarantees for Single Individual Haplotyping

2018-06-13 · Somsubhra Barik, Haris Vikalo

Single individual haplotyping is an NP-hard problem that emerges when attempting to reconstruct an organism's inherited genetic variations using data typically generated by high-throughput DNA sequencing platforms. Genom…

Matrix Completion

Scalable telomere-to-telomere assembly for diploid and polyploid genomes with double graph

2023-06-06 · Haoyu Cheng, Mobin Asri, Julian Lucas, Sergey Koren 외

Despite recent advances in the length and the accuracy of long-read data, building haplotype-resolved genome assemblies from telomere to telomere still requires considerable computational resources. In this study, we pre…

Haploid-Diploid Evolutionary Algorithms

2016-08-19 · Larry Bull

This paper uses the recent idea that the fundamental haploid-diploid lifecycle of eukaryotic organisms implements a rudimentary form of learning within evolution. A general approach for evolutionary computation is here d…

Evolutionary Algorithms