Skip to Main content Skip to Navigation
Journal articles

Finding local genome rearrangements

Krister M. Swenson 1 Pijus Simonaitis 2, 1 
1 MAB - Méthodes et Algorithmes pour la Bioinformatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The double cut and join (DCJ) model of genome rearrangement is well studied due to its mathematical simplicity and power to account for the many events that transform gene order. These studies have mostly been devoted to the understanding of minimum length scenarios transforming one genome into another. In this paper we search instead for rearrangement scenarios that minimize the number of rearrangements whose breakpoints are unlikely due to some biological criteria. One such criterion has recently become accessible due to the advent of the Hi-C experiment, facilitating the study of 3D spacial distance between breakpoint regions.
Document type :
Journal articles
Complete list of metadata
Contributor : Krister Swenson Connect in order to contact the contributor
Submitted on : Thursday, May 17, 2018 - 6:40:08 PM
Last modification on : Friday, August 5, 2022 - 3:02:17 PM


Distributed under a Creative Commons Attribution 4.0 International License




Krister M. Swenson, Pijus Simonaitis. Finding local genome rearrangements. Algorithms for Molecular Biology, BioMed Central, 2018, 13, pp.9-23. ⟨10.1186/s13015-018-0127-2⟩. ⟨lirmm-01794753⟩



Record views


Files downloads