The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gene strandedness information. In this paper we show it is a NP-hard problem by reduction to an equivalent previously-known problem, called breakpoint graph decomposition (BGD), which calls for a largest collection of edge-disjoint alternating cycles in a breakpoint graph. To obtain a better approximation algorithm for the SBD problem, we made a suitable modification to Lin and Jiang's algorithm which was initially proposed to approximate the BGD problem, and then carried out a rigorous performance analysis via fractional linear programming. The approximation ratio thus achieved for the SBD problem is , for any positive ε. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chen, X. (2010). On sorting permutations by double-cut-and-joins. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6196 LNCS, pp. 439–448). https://doi.org/10.1007/978-3-642-14031-0_47
Mendeley helps you to discover research relevant for your work.