On exploring genome rearrangement phylogenetic patterns

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

Volumn 6398 LNBI, Issue , 2010, Pages 121-136

  Xu, Andrew Wei ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE ESTIMATION; ALGORITHMIC APPROACH; BREAKPOINT DISTANCE; COMBINATORIAL STRUCTURES; DATA SETS; EDIT DISTANCE; GENOME REARRANGEMENTS; MEDIAN PROBLEM; OPTIMAL SOLUTIONS; PHYLOGENETIC INFERENCE; PROTEIN SEQUENCES; SCORING METHODS; STATISTICAL SIGNIFICANCE; SUBGRAPHS;

DNA SEQUENCES; INFORMATION DISSEMINATION; TOPOLOGY;

GENES;

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

References (18)

1. Alekseyev, M.A., Pevzner, P.: Breakpoint Graphs and Ancestral Genome Reconstructions. Genome Res. 19, 943-957 (2009)
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. Bourque, G., Pevzner, P.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36 (2002) (Pubitemid 34065587)
4. Bryant, D.: The complexity of the breakpoint median problem. TR CRM-2579. Centre de recherches mathématiques, Université de Montréal (1998)
5. Caprara, A.: The reversal median problem. INFORMS J. Comput. 15, 93-113 (2003)
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. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. JACM 46, 1-27 (1999)
8. Moret, B., Siepel, A., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, p. 521. Springer, Heidelberg (2002)
9. Murphy, W.J., Larkin, D.M., van der Wind, A.E., Bourque, G., Tesler, G., Auvil, L., Beever, J.E., Chowdhary, B.P., Galibert, F., Gatzke, L., Hitte, C., Meyers, S.N., Milan, D., Ostrander, E.A., Pape, G., Parker, H.G., Raudsepp, T., Rogatcheva, M.B., Schook, L.B., Skow, L.C., Welge, M., Womack, J.E., O'Brien, S.J., Pevzner, P.A., Lewin, H.A.: Dynamics of Mammalian Chromosome Evolution Inferred from Multispecies Comparative Maps. Science 309(5734), 613-617 (2005)
10. Pe'er, I., Shamir, R.: The median problems for breakpoints are np-complete. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1407. Springer, Heidelberg (1998)
11. Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570 (1998)
12. Sankoff, D., Blanchette, M.: Phylogenetic invariants for genome rearrangements. Journal of computational biology: a journal of computational molecular cell biology 6(3-4), 431-445 (1999)
13. Sankoff, D., Zheng, C., Wall, P.K., DePamphilis, C., Leebens-Mack, J., Albert, V.A.: Towards improved reconstruction of ancestral gene order in angiosperm phylogeny. Journal of Computational Biology: A Journal of Computational Molecular Cell Biology 16(10), 1353-1367 (2009)
14. 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)
15. Xu, A.W.: DCJ median problems on linear multichromosomal genomes: Graph representation and fast exact solutions. In: Ciccarelli, F.D., Miklós, I. (eds.) RECOMB-CG 2009. LNCS, vol. 5817, pp. 70-83. Springer, Heidelberg (2009)
16. Xu, A.W., Moret, B.M.: Genome rearrangement analysis on thousands of taxa with thousands of synteny blocks (submitted, 2010)
17. 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)
18. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346 (2005) (Pubitemid 41222437)