On the pathgroups approach to rapid small phylogeny

BMC Bioinformatics

Volumn 12, Issue SUPPL. 1, 2011, Pages

  Zheng, Chunfang ^a   Sankoff, David ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANCESTRAL GENOMES; GREEDY ALGORITHMS; HEURISTIC SOLUTIONS; PRIORITY SCHEMES; RECONSTRUCTION PROBLEMS; RUNTIMES; YEAST GENOME;

BIOLOGY; ITERATIVE METHODS; GENES;

GENES; BIOINFORMATICS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; FUNGAL GENOME; GENETICS; METHODOLOGY; PHYLOGENY; YEAST;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENOME, FUNGAL; MODELS, GENETIC; PHYLOGENY; YEASTS;

EID: 79951521544     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-12-S1-S4     Document Type: Article

References (14)

1. Sankoff D, Blanchette M. The median problem for breakpoints in comparative genomics. Computing and Combinatorics (COCOON). 3rd Annual Conference, LNCS 1997, 1276:251-263. Jiang T, Lee DT.
2. Zheng C. Pathgroups, a dynamic data structure for genome reconstruction problems. Bioinformatics 2010, 26:1587-1594. 10.1093/bioinformatics/btq255, 20483815.
3. Sankoff D, Blanchette M. Multiple genome rearrangement and breakpoint phylogeny. J Comput Biol 1998, 5:555-570. 10.1089/cmb.1998.5.555, 9773350.
4. El-Mabrouk N, Sankoff D. The reconstruction of doubled genomes. SIAM J Comput 2003, 32:754-92.
5. Warren R, Sankoff D. Genome aliquoting with double cut and join. BMC Bioinformatics 2009, 10(Suppl 1):S2. 10.1186/1471-2105-10-S1-S2, 2648758, 19208119.
6. Caprara A. On the practical solution of the reversal median problem. Algorithms in Bioinformatics. Proceedings of WABI 2001. LNCS 2001, 2149:238-251. Gascuel O, Moret BME.
7. Siepel AC. Exact algorithms for the reversal median problem. MSc thesis 2001, U New Mexico.
8. Tannier E, et al. Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 2009, 10:120. 10.1186/1471-2105-10-120, 2683817, 19386099.
9. Fertin G, et al. Combinatorics of Genome Rearrangements 2009, MIT Press.
10. Yancopoulos S, et al. Efficient sorting of genomic permutations by translocation, inversion, and block interchange. Bioinformatics 2005, 21:3340-3346. 10.1093/bioinformatics/bti535, 15951307.
11. Adam Z, Sankoff D. The ABCs of MGR with DCJ. Evol Bioinform Online 2008, 4:69-74. 2614205, 19204809.
12. Xu AW. DCJ median problems on linear multichromosomal genomes: graph representation and fast exact solutions. Comparative Genomics (RECOMB CG). 7th Annual RECOMB Satellite Workshop, LNSC 2009, 5817:7083. Ciccarelli FD, Miklos I., http://sites.google.com/site/andrewweixu/Home/software
13. Byrne KP, Wolfe KH. The Yeast Gene Order Browser: combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Res 2005, 15:1456-1461. 10.1101/gr.3672305, 1240090, 16169922.
14. Hedtke SM, et al. Resolution of phylogenetic conflict in large data sets by increased taxon sampling. Syst Biol 2006, 55:522-529. 10.1080/10635150600697358, 16861214.