Erratum: the approximability of the exemplar breakpoint distance problem

  • Authors:

  • Zhixiang Chen;Bin Fu;Binhai Zhu

  • Affiliations:

  • Department of Computer Science, University of Texas-American, Edinburg, TX;Department of Computer Science, University of Texas-American, Edinburg, TX;Department of Computer Science, Montana State University, Bozeman, MT

  • Venue:
  • FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper "The Approximability of the Exemplar Breakpoint Distance Problem" [1],, which appeared in AAIM 2006, contained several negative results and one positive result -- a claimed O (logn )-factor greedy approximation for the One-sided Exemplar Breakpoint Distance Problem. Here, we show that the analysis was incorrect and the approximation factor of the greedy algorithm could be Θ(n ), where n is the size of the alphabet.