A General Framework for Computing Rearrangement Distances between Genomes with Duplicates - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computational Biology Année : 2007

A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

Résumé

Computing genomic distances between whole genomes is a fundamental problem in comparative genomics. Recent researches have resulted in different genomic distance definitions: number of breakpoints, number of common intervals, number of conserved intervals, Maximum Adjacency Disruption number (MAD), etc. Unfortunately, it turns out that, in presence of duplications, most problems are NP-hard, and hence several heuristics have been recently proposed. However, while it is relatively easy to compare heuristics between them, until now very little is known about the absolute accuracy of these heuristics. Therefore, there is a great need for algorithmic approaches that compute exact solutions for these genomic distances. In this paper, we present a novel generic pseudo-boolean approach for computing the exact genomic distance between two whole genomes in presence of duplications, and put strong emphasis on common intervals under the maximum matching model. Of particular importance, we show three heuristics which provide very good results on a well-known public dataset of gamma-Proteobacteria.
Fichier principal
Vignette du fichier
PSBJCB.pdf (220.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00417735 , version 1 (16-09-2009)

Identifiants

Citer

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette. A General Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology, 2007, 14 (4), pp.379-393. ⟨10.1089/cmb.2007.A001⟩. ⟨hal-00417735⟩
169 Consultations
167 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More