Genome dedoubling by DCJ and reversal

Abstract : Background
Segmental duplications in genomes have been studied for many years. Recently, several studies have highlighted a biological phenomenon called breakpoint-duplication that apparently associates a significant proportion of segmental duplications in Mammals, and the Drosophila species group, to breakpoints in rearrangement events.
Results
In this paper, we introduce and study a combinatorial problem, inspired from the breakpoint-duplication phenomenon, called the Genome Dedoubling Problem. It consists of finding a minimum length rearrangement scenario required to transform a genome with duplicated segments into a non-duplicated genome such that duplications are caused by rearrangement breakpoints. We show that the problem, in the Double-Cut-and-Join (DCJ) and the reversal rearrangement models, can be reduced to an APX-complete problem, and we provide algorithms for the Genome Dedoubling Problem with 2-approximable parts. We apply the methods for the reconstruction of a non-duplicated ancestor of Drosophila yakuba.
Conclusions
We present the Genome Dedoubling Problem, and describe two algorithms solving the problem in the DCJ model, and the reversal model. The usefulness of the problems and the methods are showed through an application to real Drosophila data.
Liste complète des métadonnées

https://hal.inria.fr/hal-00784416
Contributeur : Ed. Bmc <>
Soumis le : lundi 4 février 2013 - 13:03:39
Dernière modification le : mardi 24 avril 2018 - 13:52:15
Document(s) archivé(s) le : lundi 17 juin 2013 - 18:38:36

Identifiants

Collections

Citation

Antoine Thomas, Jean-Stéphane Varré, Aïda Ouangraoua. Genome dedoubling by DCJ and reversal. BMC Bioinformatics, BioMed Central, 2011, 12 (Suppl 9), pp.S20. 〈10.1186/1471-2105-12-S9-S20〉. 〈hal-00784416〉

Partager

Métriques

Consultations de la notice

191

Téléchargements de fichiers

257