Pathgroups, a dynamic data structure for genome reconstruction problems

Bioinformatics

Volumn 26, Issue 13, 2010, Pages 1587-1594

  Zheng, Chunfang ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; FUNGAL GENOME; GENE ORDER; GENETICS; METHODOLOGY; PHYLOGENY; SACCHAROMYCES CEREVISIAE; YEAST;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENE ORDER; GENOME, FUNGAL; PHYLOGENY; SACCHAROMYCES CEREVISIAE; YEASTS;

EID: 77954206437     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq255     Document Type: Article

References (31)

1. Adam, Z. and Sankoff, D. (2003) The ABCs of MGR with DCJ. Evol. Bioinformatics, 4, 69-74.
2. Bergeron, A. et al. (2006) A unifying view of genome rearrangements. In Bücher, P. and Moret, B.M.E. (eds.) Algorithms in Bioinformatics. Proceedings of WABI 2006. Vol. 4175 of Lecture Notes in Computer Science, Springer, Berlin, pp. 163-173.
3. Bourque, G. and Pevzner, P. (2002) Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12, 26-36.
4. Byrne, K.P. and Wolfe, K.H. (2005) The Yeast Gene Order Browser: combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Res., 15, 1456-1461.
5. Caprara, A. (2001) On the practical solution of the reversal median problem. In Gascuel, O. and Moret, B.M.E. (eds) Algorithms in Bioinformatics. Proceedings of WABI 2001. Vol. 2149 of Lecture Notes in Computer Science, Springer, Berlin, pp. 238-251.
6. Choi, V. et al. (2007) Algorithms for the extraction of synteny blocks from comparative maps. In Giancarlo, R. and Hannenhalli, S. (eds) Algorithms in Bioinformatics. Proceedings of WABI 2007. Vol. 4645 of Lecture Notes in Computer Science, Springer, Berlin, pp. 277-288.
7. El-Mabrouk, N. and Sankoff, D. (2003) The reconstruction of doubled genomes. SIAM J. Comput., 32, 754-92.
8. Fertin, G. et al. (2009) Combinatorics of Genome Rearrangements. MIT Press, Cambridge, MA.
9. Genome rearrangements analysis under parsimony and other phylogenetic algorithms (2004) Available at http://www.cs.unm.edu/~moret/GRAPPA/(last accessed date May 28, 2010).
10. Gordon, J.L. et al. (2009) Additions, losses, and rearrangements on the evolutionary route from a reconstructed ancestor to the modern Saccharomyces cerevisiae genome. PLoS Genet., 5, e1000485.
11. Hannenhalli, S. and Pevzner, P.A. (1996) To cut ... or not to cut: applications of comparative physical maps in molecular evolution. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 96), Society for Industrial and Applied Mathematics, Philadlephia, pp. 304-313.
12. Hedtke, S.M. et al. (2006) Resolution of phylogenetic conflict in large data sets by increased taxon sampling. Syst. Biol., 55, 522-529.
13. Liu, T. et al. (2005) Quartet methods for phylogeny reconstruction from gene orders. In Computing and Combinatorics (COCOON). Eleventh Annual Conference.Vol. 3595 of Lecture Notes in Computer Science, Springer, Berlin, pp. 63-73.
14. Muñoz, A. and Sankoff, D. (2009) Rearrangement phylogeny of genomes in contig form. In Mandoiu, I. et al. (eds) Bioinformatics Research and Applications, 5th International Symposium (ISBRA).Vol. 5542 of Lecture Notes in Computer Science, pp. 160-172.
15. Murphy, W.J. et al. (2005) Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science, 309, 613-617.
16. Sankoff, D. and Blanchette, M. (1997) The median problem for breakpoints in comparative genomics. In Jiang, T. and Lee, D.T. (eds) Computing and Combinatorics (COCOON). Third Annual Conference. Vol. 1276 of Lecture Notes in Computer Science, Springer, Berlin, pp. 251-263.
17. Sankoff, D. and Blanchette, M. (1998) Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol., 5, 555-570.
18. Sankoff, D. et al. (2005) Reversals of fortune. In McLysaght, A. and Huson, D. (eds) Comparative Genomics (RECOMB CG). Third Annual Workshop. Vol. 3678 of Lecture Notes in Computer Science, Springer, Berlin, pp. 131-141.
19. Sankoff, D. et al. (2007) Polyploids, genome halving and phylogeny. Bioinformatics, 23, i433-i439.
20. Sankoff, D. et al. (2008) Internal validation of ancestral gene order reconstruction in angiosperm phylogeny. In Nelson, C.E. and Vialette, S. (eds) Comparative Genomics (RECOMB CG). Sixth Annual Workshop. Vol. 5267 of Lecture Notes in Computer Science, pp. 252-264.
21. Siepel, A.C. (2001) Exact algorithms for the reversal median problem. Master's Thesis, University of New Mexico, Albuquerque, NM.
22. Soltis, D.E. et al. (2009) Polyploidy and angiosperm diversification. Am. J. Bot., 96, 336-348.
23. Tang, J. and Moret, B.M.E. (2003) Phylogenetic reconstruction from gene rearrangement data with unequal gene contents. In Proceedings of the 8th Workshop on Algorithms and Data Structures (WADS). Vol. 2748 of Lecture Notes in Computer Science, Springer, Berlin, pp. 37-46.
24. Tannier, E. (2009) Yeast ancestral genome reconstructions: the possibilities of computational methods. In Ciccarelli, F.D. and Miklós, I. (eds) Comparative Genomics (RECOMB CG). Seventh Annual Workshop. Vol. 5817 of Lecture Notes in Computer Science, Springer, Berlin, pp. 1-12.
25. Tannier, E. et al. (2009) Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics, 10, 120.
26. Warren, R. and Sankoff, D. (2009) Genome aliquoting with double cut and join. BMC Bioinformatics, 10 (Suppl. 1), 1-11.
27. Yancopoulos, S. et al. (2005) Efficient sorting of genomic permutations by translocation, inversion, and block interchange. Bioinformatics, 21, 3340-3346.
28. Zheng, C. and Sankoff, D. (2006) Genome rearrangements with partially ordered chromosomes. J. Comb. Optim., 11, 133-144.
29. Zheng, C. et al. (2006) Genome halving with an outgroup. Evol. Bioinformatics, 2, 319-326.
30. Zheng, C. et al. (2007) Removing noise and ambiguities from comparative maps in rearrangement analysis. Trans. Comput. Biol. Bioinf., 4, 515-522.
31. Zheng, C. et al. (2008) Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes. Bioinformatics, 24, i96-i104.