Genome Dedoubling by DCJ and Reversal
Document type :
Article dans une revue scientifique: Article original
Title :
Genome Dedoubling by DCJ and Reversal
Author(s) :
Thomas, Antoine [Auteur]
Bioinformatics and Sequence Analysis [BONSAI]
Varré, Jean-Stéphane [Auteur]
Bioinformatics and Sequence Analysis [BONSAI]
Aïda, Ouangraoua [Auteur]
Bioinformatics and Sequence Analysis [BONSAI]
Bioinformatics and Sequence Analysis [BONSAI]
Varré, Jean-Stéphane [Auteur]

Bioinformatics and Sequence Analysis [BONSAI]
Aïda, Ouangraoua [Auteur]
Bioinformatics and Sequence Analysis [BONSAI]
Journal title :
BMC Bioinformatics
Publisher :
BioMed Central
Publication date :
2011
ISSN :
1471-2105
English keyword(s) :
Segmental Duplication
Ancestral Genome
Duplicate Segment
Rearrangement Event
Linear Time Complexity
Ancestral Genome
Duplicate Segment
Rearrangement Event
Linear Time Complexity
HAL domain(s) :
Informatique [cs]/Bio-informatique [q-bio.QM]
English abstract : [en]
BackgroundSegmental duplications in genomes have been studied for many years. Recently, several studies have highlighted a biological phenomenon called <i>breakpoint-duplication</i> that apparently associates a significant ...
Show more >BackgroundSegmental duplications in genomes have been studied for many years. Recently, several studies have highlighted a biological phenomenon called <i>breakpoint-duplication</i> that apparently associates a significant proportion of segmental duplications in Mammals, and the Drosophila species group, to breakpoints in rearrangement events.ResultsIn this paper, we introduce and study a combinatorial problem, inspired from the breakpoint-duplication phenomenon, called the <i>Genome Dedoubling Problem</i>. 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 <i>Drosophila yakuba</i>.ConclusionsWe present the <i>Genome Dedoubling Problem</i>, 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.Show less >
Show more >BackgroundSegmental duplications in genomes have been studied for many years. Recently, several studies have highlighted a biological phenomenon called <i>breakpoint-duplication</i> that apparently associates a significant proportion of segmental duplications in Mammals, and the Drosophila species group, to breakpoints in rearrangement events.ResultsIn this paper, we introduce and study a combinatorial problem, inspired from the breakpoint-duplication phenomenon, called the <i>Genome Dedoubling Problem</i>. 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 <i>Drosophila yakuba</i>.ConclusionsWe present the <i>Genome Dedoubling Problem</i>, 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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Comment :
Proceedings of the Ninth Annual Research in Computational Molecular Biology (RECOMB) Satellite Workshop on Comparative Genomics
Collections :
Source :
Files
- https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3283308/pdf
- Open access
- Access the document
- Open access
- Access the document