Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals
 Alberto Caprara,
 Romeo Rizzi
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present, \(\frac{3}{2}\) is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD), calls for a largest collection of edge disjoint cycles in a suitablydefined graph. It has been shown that for almost all instances SBR is equivalent to BGD, in the sense that any solution of the latter corresponds to a solution of the former having the same value. In this paper, we show how to improve the approximation ratio achievable in polynomial time for BGD, from the previously known \(\frac{3}{2}\) to \(\frac{{33}}{{23}} + \varepsilon \) for any ε > 0. Combined with the results in (Caprara, Journal of Combinatorial Optimization, vol. 3, pp. 149–182, 1999b), this yields the same approximation guarantee for n! − O((n − 5)!) out of the n! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield an automatic improvement of our result.
 V. Bafna and P.A. Pevzner, “Genome rearrangements and sorting by reversals,” SIAM Journal on Computing, vol. 25, pp. 272–289, 1996.
 P. Berman and T. Fujito, “On approximation properties of the independent set problem for low degree graphs,” Theory of Computing Systems, vol. 32, pp. 115–132, 1999.
 P. Berman and M. Fürer, “Approximating maximum independent set in bounded degree graphs,” in Proceedings of the 5th Annual ACMSIAM Symposium on Discrete Algorithms, ACM Press: New York, 1994.
 P. Berman and M. Karpinski, “On some tighter in approximability results,” ECCC Report No. 29, University of Trier, 1998.
 A. Caprara, “Sorting permutations by reversals and eulerian cycle decompositions,” SIAM Journal on Discrete Mathematics, vol. 12, pp. 91–110, 1999a.
 A. Caprara, “On the tightness of the alternatingcycle lower bound for sorting by reversals,” Journal of Combinatorial Optimization, vol. 3, pp. 149–182, 1999b.
 A. Caprara, G. Lancia, and S.K. Ng, “Fast practical solution of sorting by reversals,” in Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms, ACM Press: New York, 2000.
 D.A. Christie, “A 3/2 approximation algorithm for sorting by reversals,” in Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms, pp. 244–252, ACM Press: New York, 1998.
 S. Hannenhalli and P.A. Pevzner, “Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals),” Journal of the ACM, vol. 48, pp. 1–27, 1999.
 C.A.J. Hurkens and A. Schrijver, “On the size of systems of sets every t of which have an SDR, with an application to the worstcase ratio of heuristics for packing problems,” SIAM Journal on Discrete Mathematics, vol. 2, pp. 68–72, 1989.
 J. Kececioglu and D. Sankoff, “Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement,” Algorithmica, vol. 13, pp. 180–210, 1995.
 Title
 Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals
 Journal

Journal of Combinatorial Optimization
Volume 6, Issue 2 , pp 157182
 Cover Date
 20020601
 DOI
 10.1023/A:1013851611274
 Print ISSN
 13826905
 Online ISSN
 15732886
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 sorting by reversals
 breakpoint graph
 alternating cycle decomposition
 set packing
 stable set
 approximation algorithm
 Industry Sectors
 Authors

 Alberto Caprara ^{(1)}
 Romeo Rizzi ^{(2)}
 Author Affiliations

 1. DEIS, University of Bologna, Viale Risorgimento 2, I40136, Bologna, Italy
 2. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK8000, Aarhus C, Denmark