Year: 2025
Type: article
Abstract: This article considers the problem of 3-dimensional genome reconstruction for single-cell data, and the uniqueness of such reconstructions in the setting of haploid organisms. We consider multiple graph models as representations of this problem, and use techniques from graph rigidity theory to determine identifiability. Biologically, our models come from Hi-C data, microscopy data, and combinations thereof. Mathematically, we use unit ball and sphere packing models, as well as models consisting of distance and inequality constraints. In each setting, we describe and/or derive new results on realisability and uniqueness. We then propose a 3D reconstruction method based on semidefinite programming and apply it to synthetic and real data sets using our models.
Source: Journal of Mathematical Biology
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: hybrid
Estimated APC paid: $3,090
Awards: Exploiting combinatorial structures for algebraic and geometric decompositions, Realizations of Rigid Graphs, Abstract rigidity for natural stability problems, G4120167447, G4869584417, G4872507874, G562246749, Matroids in Applied and Combinatorial Commutative Algebra, G7618753153, G8590477180
OpenAlex ID: W4409039117
