%0 Book Section
%B Algorithms — ESA 2002Algorithms — ESA 2002
%D 2002
%T 1.375-Approximation Algorithm for Sorting by Reversals
%A Berman,Piotr
%A Hannenhalli, Sridhar
%A Karpinski,Marek
%E Möhring,Rolf
%E Raman,Rajeev
%X Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals , MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations by reversals, and a polynomial time algorithm for a special case of unsigned permutations. The best known approximation algorithm for MIN-SBR, due to Christie, gives a performance ratio of 1.5. In this paper, by exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, we design a new 1.375-algorithm for the MIN-SBR problem.
%B Algorithms — ESA 2002Algorithms — ESA 2002
%S Lecture Notes in Computer Science
%I Springer Berlin / Heidelberg
%V 2461
%P 401 - 408
%8 2002///
%@ 978-3-540-44180-9
%G eng
%U http://dx.doi.org/10.1007/3-540-45749-6_21