The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated

Abstract : A promising and active field of comparative genomics con- sists in comparing two genomes by establishing a one-to-one correspon- dence (i.e., a matching) between their genes. This correspondence is usu- ally chosen in order to optimize a predefined measure. One such problem is the Exemplar Breakpoint Distance problem (or EBD, for short), which asks, given two genomes modeled by signed sequences of charac- ters, to keep and match exactly one occurrence of each character in the two genomes (a process called exemplarization), so as to minimize the number of breakpoints of the resulting genomes. Bryant [6] showed that EBD is NP-complete. In this paper, we close the study of the approximation of EBD by showing that no approximation factor can be derived for EBD considering non-trivial genomes - i.e. genomes that contain duplicated genes.
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, September 15, 2009 - 10:24:41 AM
Last modification on : Wednesday, May 23, 2018 - 3:44:02 PM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 11:38:14 PM


Files produced by the author(s)


  • HAL Id : hal-00416491, version 1


Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. WALCOM 2009, 2009, Kolkata, India. pp.357-368. ⟨hal-00416491⟩



Record views


Files downloads