Inapproximability of (1,2)-Exemplar Distance

Laurent Bulteau (1) , Minghui Jiang (2)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 Department of Computer Science Utah State University

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 G1 and G2 where each gene occurs at most s times in G1 and at most t times in G2. We show that the simplest non-trivial variant of the exemplar distance problem, (1,2)-Exemplar Distance, is already hard to approximate for a wide variety of distance measures, including popular genome rearrangement measures such as adjacency disruptions and signed reversals, and classic string edit distance measures such as Levenshtein and Hamming distances

Domaines: Informatique [cs]

Laurent Bulteau, Minghui Jiang. Inapproximability of (1,2)-Exemplar Distance. Bioinformatics Research and Applications, 2012, Dallas, United States. pp.13-23, ⟨10.1007/978-3-642-30191-9_2⟩. ⟨hal-01171579⟩