Abstract
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 \(\frac{17}{12}+\epsilon \approx 1.4167 +\epsilon\), for any positive ε.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. In: 34th IEEE Annual Symposium on Foundations of Computer Science, pp. 148–157 (1993)
Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272–289 (1996)
Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163–173. Springer, Heidelberg (2006)
Berman, P., Fürer, M.: Approximating maximum independent set in bounded degree graphs. In: The fifth annual ACM-SIAM symposium on Discrete Algorithms, pp. 365–371 (1994)
Caprara, A., Rizzi, R.: Improved approximation for breakpoint graph decomposition and sorting by reversals. J. Comb. Optim. 6(2), 157–182 (2002)
Christie, D.A.: A 3/2-approximation algorithm for sorting by reversals. In: The ninth annual ACM-SIAM symposium on Discrete Algorithms, pp. 244–252 (1998)
Halldórsson, M.M.: Approximating discrete collections via local improvements. In: The sixth annual ACM-SIAM symposium on Discrete Algorithms, pp. 160–169 (1995)
Hannenhalli, S., Pevzner, P.A.: To cut.. or not to cut (applications of comparative physical maps in molecular evolution). In: The seventh annual ACM-SIAM symposium on Discrete Algorithms, pp. 304–313 (1996)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103 (1972)
Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180–210 (1995)
Lin, G., Jiang, T.: A further improved approximation algorithm for breakpoint graph decomposition. J. Comb. Optim. 8(2), 183–194 (2004)
Lin, Y., Moret, B.: Estimating true evolutionary distances under the DCJ model. Bioinformatics 24(13), 114–122 (2008)
Warren, R., Sankoff, D.: Genome halving with double cut and join. In: The 6th Asia-Pacific Bioinformatics Conference, vol. 6, pp. 231–240 (2008)
Warren, R., Sankoff, D.: Genome aliquoting with double cut and join. BMC Bioinformatics 10(Suppl. 1), S2 (2009)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340–3346 (2005)
Zhang, M., Arndt, W., Tang, J.: An exact solver for the dcj median problem. In: Pacific Symposium on Biocomputing, pp. 138–149 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X. (2010). On Sorting Permutations by Double-Cut-and-Joins. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)