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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chen, Z., Fu, B., Zhu, B.: The Approximability of the Exemplar Breakpoint Distance Problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 291–302. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Z., Fu, B., Zhu, B. (2012). Erratum: The Approximability of the Exemplar Breakpoint Distance Problem. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-29700-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29699-4
Online ISBN: 978-3-642-29700-7
eBook Packages: Computer ScienceComputer Science (R0)