title: Inapproximability of (1,2)-exemplar distance.
abstract: Given two genomes possibly with duplicate genes, the exemplar distance problem is that of removing all but one copy of each gene in each genome, so as to minimize the distance between the two reduced genomes according to some measure. Let $((s,t))$-exemplar distance denote the exemplar distance problem on two genomes $(G_1)$ and $(G_2)$, where each gene occurs at most $(s)$ times in $(G_1)$ and at most $(t)$ times in $(G_2)$. We show that the simplest nontrivial variant of the exemplar distance problem, $((1,2))$-Exemplar Distance, is already hard to approximate for a wide variety of distance measures, including both popular genome rearrangement measures such as adjacency disruptions, signed reversals, and signed double-cut-and-joins, and classic string edit distance measures such as Levenshtein and Hamming distances.
authors.affiliation: Université de Nantes, Nantes.
authors.forename: Laurent
authors.initials: L
authors.lastname: Bulteau
authors.affiliation: Utah State University, Logan.
authors.forename: Minghui
authors.initials: M
authors.lastname: Jiang
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D019143:Evolution, Molecular; D017353:Gene Deletion; D016678:Genome; D008957:Models, Genetic; D012984:Software