A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes

Abstract : Comparing genomes of different species has become a crucial problem in comparative genomics. Recent research have resulted in different genomic distance definitions: number of breakpoints, number of common intervals, number of conserved intervals, Maximum Adjacency Disruption number (MAD), etc. Classical methods (usually based on permutations of gene order) for computing genomic distances between whole genomes are however seriously compromised for genomes where several copies of the same gene may be scattered across the genome. Most approaches to overcoming this difficulty are based on the exemplar method (keep exactly one copy in each genome of each duplicated gene) and the maximum matching method (keep as many copies as possible in each genome of each duplicated gene). Unfortunately, it turns out that, in presence of duplications, most problems are NP–hard, and hence several heuristics have been recently proposed. Extending research initiated in [2], we propose in this paper a novel generic pseudo-boolean approach for computing the exact breakpoint distance between two genomes in presence of duplications for both the exemplar and maximum matching methods. We illustrate the application of this methodology on a well-known public benchmark dataset of gamma -Proteobacteria.
Type de document :
Communication dans un congrès
5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4751), pp.16-29, 2007, Lecture Notes in BioInformatics (LNBI)
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00417902
Contributeur : Guillaume Fertin <>
Soumis le : jeudi 17 septembre 2009 - 11:44:00
Dernière modification le : mercredi 23 mai 2018 - 15:44:02
Document(s) archivé(s) le : mardi 16 octobre 2012 - 11:01:12

Fichier

RCG07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00417902, version 1

Citation

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette. A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4751), pp.16-29, 2007, Lecture Notes in BioInformatics (LNBI). 〈hal-00417902〉

Partager

Métriques

Consultations de la notice

954

Téléchargements de fichiers

108