The problem of chromosome reincorporation in DCJ sorting and halving

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

Volumn 6398 LNBI, Issue , 2010, Pages 13-24

  Kováč, Jakub ^a,b   Braga, Marília D V ^b   Stoye, Jens ^b  

^a Faculty of Natural Sciences   (Slovakia)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR-TIME ALGORITHMS; QUADRATIC ALGORITHMS; DOUBLE CUT AND JOINS;

CLUSTERING ALGORITHMS; GENES; CHROMOSOMES;

PROBLEM SOLVING;

EID: 78649944195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16181-0_2     Document Type: Conference Paper

References (15)

1. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346 (2005) (Pubitemid 41222437)
2. 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)
3. Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60, 165-169 (1996)
4. Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms 3 (2007)
5. Swenson, K.M., Rajan, V., Lin, Y., Moret, B.M.E.: Sorting signed permutations by inversions in O(n log n) time. JCB 17, 489-501 (2010)
6. Warren, R., Sankoff, D.: Genome halving with double cut and join. JBCB 7, 357-371 (2009)
7. Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 276-286. Springer, Heidelberg (2008)
8. Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10 (2009)
9. El-Mabrouk, N., Sankoff, D.: The reconstruction of doubled genomes. SIAM J. Comput. 32, 754-792 (2003)
10. Kaplan, H., Verbin, E.: Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3), 321-341 (2005)
11. Han, Y.: Improving the efficiency of sorting by reversals. In: Arabnia, H.R., Valafar, H. (eds.) BIOCOMP, pp. 406-409. CSREA Press (2006)
12. Chrobak, M., Szymacha, T., Krawczyk, A.: A data structure useful for finding hamiltonian cycles. Theor. Comput. Sci. 71, 419-424 (1990)
13. Tannier, E., Bergeron, A., Sagot, M.F.: Advances on sorting by reversals. Discrete Applied Mathematics 155, 881-888 (2007)
14. 3/2√log(n)) algorithm for sorting by reciprocal translocations. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 258-269. Springer, Heidelberg (2006)
15. Bérard, S., Chateau, A., Chauve, C., Paul, C., Tannier, E.: Computation of perfect dcj rearrangement scenarios with linear and circular chromosomes. JCB 16, 1287-1309 (2009), PMID: 19803733