Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes

Abstract : Comparing genomes of different species is a fundamental problem in comparative genomics. Recent research has resulted in the introduction of different measures between pairs of genomes: reversal distance, number of breakpoints, number of common or conserved intervals, etc. However, classical methods used for computing such measures are seriously compromised when genomes have several copies of the same gene scattered across them. Most approaches to overcome this difficulty are based either on the exemplar model, which keeps exactly one copy in each genome of each duplicated gene, or on the maximum matching model, which keeps as many copies as possible of each duplicated gene. The goal is to find an exemplar matching, respectively a maximum matching, that optimizes the studied measure. Unfortunately, it turns out that, in presence of duplications, this problem for each above-mentioned measure is NP-hard. In this paper, we propose to compute the minimum number of breakpoints and the maximum number of adjacencies between two genomes in presence of duplications using two different approaches. The first one is a (exact) generic 0–1 linear programming approach, while the second is a collection of three heuristics. Each of these approaches is applied on each problem and for each of the following models: exemplar, maximum matching and intermediate model, that we introduce here. All these programs are run on a well-known public benchmark dataset of -Proteobacteria, and their performances are discussed.
Type de document :
Article dans une revue
Journal of Computational Biology, Mary Ann Liebert, 2008, 15 (8), pp.1093-1115
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00416446
Contributeur : Guillaume Fertin <>
Soumis le : mardi 15 septembre 2009 - 10:26:21
Dernière modification le : mercredi 23 mai 2018 - 15:44:02
Document(s) archivé(s) le : mardi 16 octobre 2012 - 10:51:38

Fichier

JCB-2008.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00416446, version 1

Citation

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes. Journal of Computational Biology, Mary Ann Liebert, 2008, 15 (8), pp.1093-1115. 〈hal-00416446〉

Partager

Métriques

Consultations de la notice

575

Téléchargements de fichiers

196