Comparing Genomes with Duplications: a Computational Complexity Point of View

Abstract : In this paper, we are interested in the computational complexity of computing (dis)similarity measures between two genomes when they contain duplicated genes or genomic markers, a problem that happens frequently when comparing whole nuclear genomes. Recently, several methods ( [1], [2]) have been proposed that are based on two steps to compute a given (dis)similarity measure M between two genomes G1 and G2: first, one establishes a one-to-one correspondence between genes of G1 and genes of G2 ; second, once this correspondence is established, it defines explicitly a permutation and it is then possible to quantify their similarity using classical measures defined for permutations, like the number of breakpoints. Hence these methods rely on two elements: a way to establish a one-to-one correspondence between genes of a pair of genomes, and a (dis)similarity measure for permutations. The problem is then, given a (dis)similarity measure for permutations, to compute a correspondence that defines an optimal permutation for this measure. We are interested here in two models to compute a one-to-one correspondence: the exemplar model, where all but one copy are deleted in both genomes for each gene family, and the matching model, that computes a maximal correspondence for each gene family. We show that for these two models, and for three (dis)similarity measures on permutations, namely the number of common intervals, the maximum adjacency disruption (MAD) number and the summed adjacency disruption (SAD) number, the problem of computing an optimal correspondence is NP-complete, and even APX-hard for the MAD number and SAD number.
Type de document :
Article dans une revue
ACM Transactions on Computational Logic, Association for Computing Machinery, 2007, 4 (4), pp.523-534
Liste complète des métadonnées

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

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

Fichier

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

Identifiants

  • HAL Id : hal-00417720, version 1

Citation

Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Comparing Genomes with Duplications: a Computational Complexity Point of View. ACM Transactions on Computational Logic, Association for Computing Machinery, 2007, 4 (4), pp.523-534. 〈hal-00417720〉

Partager

Métriques

Consultations de la notice

438

Téléchargements de fichiers

121