Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals

Caprara, Alberto and Rizzi, Romeo (2002) Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. UNSPECIFIED.

[img]
Preview
PDF
Download (700Kb) | Preview

    Abstract

    Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present, 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 suitably-defined 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}+\eps$ for any $\eps>0$. 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.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: Sorting by reversals, breakpoint graph, alternating cycle decomposition, set packing, stable set, approximation algorithm
    Report Number: DIT-02-082
    Repository staff approval on: 16 Dec 2002

    Actions (login required)

    View Item