Artículos de revistas
Sorting By Prefix Reversals And Prefix Transpositions
Registro en:
Sorting By Prefix Reversals And Prefix Transpositions. Elsevier Science Bv, v. 181, p. 78-89 JAN-2015.
0166-218X
WOS:000347364700008
10.1016/j.dam.2014.09.004
Autor
Dias
Zanoni; Dias
Ulisses
Institución
Resumen
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) In this paper, we present a new algorithm for the Sorting by Prefix Reversals and Prefix Transpositions Problem. The previous approximation algorithm was bounded by factor 3, and here we present an asymptotic 2-approximation algorithm. We consider theoretical and practical aspects in our analysis, and we show that our method is better than other approaches in both cases. (C) 2014 Elsevier B.V. All rights reserved. 181
78 89 Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) FAPESP [2012/01584-3] CNPq [306730/2012-0, 477692/2012-5, 483370/2013-4]