Tandem Halving Problems by DCJ - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2012

Tandem Halving Problems by DCJ

(1) , (1) , (1, 2)
1
2

Résumé

We address the problem of reconstructing a non-duplicated ancestor to a partially duplicated genome in a model where duplicated content is caused by several tandem duplications throughout its evolution and the only allowed rearrangement operations are DCJ. As a starting point, we consider a variant of the Genome Halving Problem, aiming at reconstructing a tandem duplicated genome instead of the traditional perfectly duplicated genome. We provide a distance in O(n) time and a scenario in O(n2) time. In an attempt to enhance our model, we consider several problems related to multiple tandem reconstruction. Unfortunately we show that although the problem of reconstructing a single tandem can be solved polynomially, it is already NP-hard for 2 tandems.
Fichier principal
Vignette du fichier
article3.pdf (324.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00749019 , version 1 (06-11-2012)

Identifiants

Citer

Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré. Tandem Halving Problems by DCJ. Workshop on Algorithms in Bioinformatics, Sep 2012, Ljubljana, Slovenia. pp.417-429, ⟨10.1007/978-3-642-33122-0_33⟩. ⟨hal-00749019⟩
212 Consultations
123 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More