Finding local genome rearrangements - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Algorithms for Molecular Biology Year : 2018

Finding local genome rearrangements

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.
Fichier principal
Vignette du fichier
s13015-018-0127-2.pdf (2.24 Mo) Télécharger le fichier

Dates and versions

lirmm-01794753 , version 1 (17-05-2018)

Licence

Attribution

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More