DCJ median problems on linear multichromosomal genomes: Graph representation and fast exact solutions

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

Volumn 5817 LNBI, Issue , 2009, Pages 70-83

  Xu, Andrew Wei ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BREAKPOINT; DECOMPOSITION THEORY; DISTANCE MEASURE; EXACT SOLUTION; GENOME REARRANGEMENTS; GRAPH REPRESENTATION; INTERNAL NODES; LINEAR CHROMOSOME; MEDIAN PROBLEM; MULTICHROMOSOMAL GENOMES; NP-HARD; PHYLOGENETIC RECONSTRUCTION; REVERSAL DISTANCE;

TREES (MATHEMATICS);

GENES;

EID: 77958048485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04744-2_7     Document Type: Conference Paper

References (17)

1. Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bioinformatics 4, 69-74 (2008)
2. Bader, D., Moret, B., Yan, M.: A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol. 8(5), 483-491 (2001)
3. Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36 (2002)
4. Caprara, A.: The reversal median problem. INFORMS J. Comput. 15, 93-113 (2003)
5. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. In: Proc. 27th ACM Symp. on Theory of Computing STOC 1995, pp. 178-189. ACM, New York (1995)
6. Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. 43rd IEEE Symp. on Foudations of Computer Science FOCS 1995, pp. 581-592. IEEE Computer Soc., Los Alamitos (1995)
7. Lenne, R., Solnon, C., Stützle, T., Tannier, E., Birattari, M.: Reactive stochastic local search algorithms for the genomic median problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 266-276. Springer, Heidelberg (2008)
8. Siepel, A., Moret, B.: Finding an optimal inversion median: Experimental results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 189-203. Springer, Heidelberg (2001)
9. Swenson, K., Rajan, V., Lin, Y., Moret, B.: Sorting signed permutations by inversions in o(nlogn) time. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 386-399. Springer, Heidelberg (2009)
10. Swenson, K., To, Y., Tang, J.,Moret, B.: Maximum independent sets of commuting and noninterfering inversions. In: Proc. 7th Asia-Pacific Bioinformatics Conf. APBC 2009, vol. 10 (suppl. 1), p. S6 (2009)
11. Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 1-13. Springer, Heidelberg (2008)
12. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587-609 (2002)
13. Xu, A.: The distance between randomly constructed genomes. In: Proc. 5th Asia-Pacific Bioinformatics Conf. APBC 2007. Advances in Bioinformatics and Computational Biology, vol. 5, pp. 227-236. Imperial College Press, London (2007)
14. Xu, A.: A fast and exact algorithm for the median of three problem-A graph decomposition approach. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol. 5267, pp. 184-197. Springer, Heidelberg (2008)
15. Xu, A.W., Sankoff, D.: Decompositions of multiple breakpoint graphs and rapid exact solutions to the median problem. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 25-37. Springer, Heidelberg (2008)
16. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346 (2005)
17. Zhang, M., Arndt, W., Tang, J.: An exact median solver for the DCJ distance. In: Proc. 14th Pacific Symposium on Biocomputing PSB 2009, pp. 138-149. World Scientific, Singapore (2009)