On sorting permutations by double-cut-and-joins

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6196 LNCS, Issue , 2010, Pages 439-448

  Chen, Xin ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING CYCLE; APPROXIMATION RATIOS; BREAKPOINT; GRAPH DECOMPOSITIONS; NP-HARD PROBLEM; PERFORMANCE ANALYSIS;

LINEARIZATION;

APPROXIMATION ALGORITHMS;

EID: 77955024473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14031-0_47     Document Type: Conference Paper

References (16)

1. 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)
2. Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272-289 (1996)
3. 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)
4. 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)
5. Caprara, A., Rizzi, R.: Improved approximation for breakpoint graph decomposition and sorting by reversals. J. Comb. Optim. 6(2), 157-182 (2002)
6. 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)
7. Halld́orsson, M.M.: Approximating discrete collections via local improvements. In: The sixth annual ACM-SIAM symposium on Discrete Algorithms, pp. 160-169 (1995)
8. 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)
9. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103 (1972)
10. Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180-210 (1995)
11. Lin, G., Jiang, T.: A further improved approximation algorithm for breakpoint graph decomposition. J. Comb. Optim. 8(2), 183-194 (2004)
12. Lin, Y., Moret, B.: Estimating true evolutionary distances under the DCJ model. Bioinformatics 24(13), 114-122 (2008)
13. Warren, R., Sankoff, D.: Genome halving with double cut and join. In: The 6th Asia-Pacific Bioinformatics Conference, vol.6, pp. 231-240 (2008)
14. Warren, R., Sankoff, D.: Genome aliquoting with double cut and join. BMC Bioinformatics 10(Suppl. 1), S2 (2009)
15. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340-3346 (2005)
16. Zhang, M., Arndt, W., Tang, J.: An exact solver for the dcj median problem. In: Pacific Symposium on Biocomputing, pp. 138-149 (2009)