How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation

Sébastien Angibaud 1, * Guillaume Fertin 1 Irena Rusu 1 Stéphane Vialette 2
* Auteur correspondant
2 Algorithmics
LRI - Laboratoire de Recherche en Informatique
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 very strong evidence that the simple LCS heuristic provides very good results on a well-known public benchmark dataset of gamma-Proteobacteria.
Type de document :
Communication dans un congrès
4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4205), pp.75-86, 2006, Lecture Notes in BioInformatics (LNBI)
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00418258
Contributeur : Guillaume Fertin <>
Soumis le : jeudi 17 septembre 2009 - 16:37:35
Dernière modification le : mercredi 23 mai 2018 - 15:44:02
Document(s) archivé(s) le : mardi 15 juin 2010 - 22:04:48

Fichier

RECOMB-CG06.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00418258, version 1

Collections

Citation

Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette. How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation. 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4205), pp.75-86, 2006, Lecture Notes in BioInformatics (LNBI). 〈hal-00418258〉

Partager

Métriques

Consultations de la notice

426

Téléchargements de fichiers

196