An exact solver for the DCJ median problem

Pacific Symposium on Biocomputing 2009, PSB 2009

Volumn , Issue , 2009, Pages 138-149

  Zhang, Meng ^a   Arndt, William ^b   Tang, Jijun ^b  

^a JILIN UNIVERSITY   (China)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTENSIVE SIMULATIONS; GENOME REARRANGEMENTS; MEDIAN PROBLEM; REAL DATA SETS; SIGNED PERMUTATIONS; TEST CASE;

GENES;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOMETRY; CHROMOSOME; COMPARATIVE STUDY; COMPUTER SIMULATION; GENE REARRANGEMENT; GENETIC DATABASE; GENETICS; GENOME; GENOMICS; STATISTICS;

ALGORITHMS; BIOMETRY; CHROMOSOMES; COMPUTER SIMULATION; DATABASES, GENETIC; GENE REARRANGEMENT; GENOME; GENOMICS; MODELS, GENETIC;

EID: 61949276435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Z. Adam and D. Sankoff. The abcs of mgr with dcj. Evolutionary Bioinformatics, 4:69-74, 2008. (Pubitemid 351552417)
2. A. Bergeron, J. Mixtacki, and J. Stoye. A unifying view of genome rearrangements. In Proc. 6th Int'l Workshop Algs. in Bioinformatics (WABI'06), number 4175 in Lecture Notes in Computer Science, pages 163-173, 2006. (Pubitemid 44609667)
3. A. Caprara. On the practical solution of the reversal median problem. In Proc. 1st Int'l Workshop Algs. in Bioinformatics (WABI'01), volume 2149 of Lecture Notes in Computer Science, pages 238-251, 2001. (Pubitemid 33322586)
4. S.R. Downie and J. D. Palmer. Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In P. Soltis, D. Soltis, and J.J. Doyle, editors, Plant Molecular Systematics, pages 14-35. Chapman and Hall, 1992.
5. S. Hannenhalli and P.A. Pevzner. Transforming mice into men (polynomial algorithm for genomic distance problems). In Proc. 36th Ann. IEEE Symp. Foundations of Comput. Sci. (FOCS'95), pages 581-592, 1995.
6. B.M.E. Moret, A.C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In Proc. 2nd Int'l Workshop Algs. in Bioinformatics (WABI'02), volume 2452 of Lecture Notes in Computer Science, pages 521-536, 2002.
7. D. Sankoff and M. Blanchette. The median problem for breakpoints in comparative genomics. In Proc. 3rd Int 'l Conf. Computing and Combinatorics (COCOON'97), volume 1276 of Lecture Notes in Computer Science, pages 251-264. Springer Verlag, Berlin, 1997.
8. A.C. Siepel and B.M.E. Moret. Finding an optimal inversion median: Experimental results. In Proc. 1st Int'l Workshop Algs. in Bioinformatics (WABI'01), volume 2149 of Lecture Notes in Computer Science, pages 189-203. Springer Verlag, Berlin, 2001. (Pubitemid 33322582)
9. E. Thnnier, C. Zheng, and D. Sankoff. Multichromosomal genome median and halving problems. In Proc. 8th Int'l Workshop Algs. in Bioinformatics (WA BI'08), volume 5251 of Lecture Notes in Computer Science, pages 1-13, 2008.
10. G. Tesler. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci., 63(5):587-609, 2002.
11. W. Xu and D. Sankoff. Decompositions of multiple breakpoint graphs and rapid exact solutions to the median problem. In Proc. 8th Int'l Workshop Algs. in Bioinformatics (WABI'08), volume 5251 of Lecture Notes in Computer Science, pages 25-37, 2008.
12. S. Yancopoulos, O. Attie, and R. Friedberg. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21(16) :3340-3346, 2005. (Pubitemid 41222437)
13. M. Zhang, W. Arndt, and J. Tang. A branch-and-bound method for the multichromosomal reversal median problem. In Proc. 8th Int 'l Workshop Algs. in Bioinformatics (WABI'08), volume 5251 of Lecture Notes in Computer SCience, pages 14-24, 2008.