Finding local genome rearrangements

Krister 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.
Type de document :
Article dans une revue
Algorithms for Molecular Biology, BioMed Central, 2018, 13 (9), 〈10.1186/s13015-018-0127-2〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01794753
Contributeur : Krister Swenson <>
Soumis le : jeudi 17 mai 2018 - 18:40:08
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Lien texte intégral

Identifiants

Collections

Citation

Krister Swenson, Pijus Simonaitis. Finding local genome rearrangements. Algorithms for Molecular Biology, BioMed Central, 2018, 13 (9), 〈10.1186/s13015-018-0127-2〉. 〈lirmm-01794753〉

Partager

Métriques

Consultations de la notice

95