An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes

Computing the genome rearrangement distance is an important subject in computational biology. The double cut and join operation(abbreviated as DCJ) has been extensively used for genome rearrangement over the last few years. When the genomes contain duplicate genes or segments, computing the DCJ distance becomes NP-hard, and there are scarcely positive results besides exploiting the algorithms for ...