A General Framework for Computing Rearrangement Distances between Genomes with Duplicates

Abstract : 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.
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

Contributor : Guillaume Fertin <>
Submitted on : Wednesday, September 16, 2009 - 4:56:28 PM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 11:46:35 PM


Files produced by the author(s)


  • HAL Id : hal-00417735, version 1


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, Mary Ann Liebert, 2007, 14 (4), pp.379-393. ⟨hal-00417735⟩



Record views


Files downloads