Guided genome halving: Hardness, heuristics and the history of the Hemiascomycetes

Bioinformatics

Volumn 24, Issue 13, 2008, Pages

  Zheng, Chunfang ^a   Zhu, Qian ^a   Adam, Zaky ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; ASCOMYCETES; CANDIDA GLABRATA; CONTROLLED STUDY; FUNCTIONAL GENOMICS; FUNGAL GENETICS; GENE CONSTRUCT; GENE DUPLICATION; GENETIC ALGORITHM; GENETIC DATABASE; GENETIC VARIABILITY; GENOME ANALYSIS; HEMIASCOMYCETES; MOLECULAR EVOLUTION; NONHUMAN; PLESIOMORPHY; PRIORITY JOURNAL; SACCHAROMYCES CEREVISIAE; SCALE UP; YEAST;

CANDIDA GLABRATA; SACCHAROMYCES CEREVISIAE; SACCHAROMYCETES;

HEURISTIC METHODS; INTELLIGENT SYSTEMS; MOLECULAR BIOLOGY; YEAST;

ANCESTRAL GENOMES; BRUTE FORCE; CANDIDA GLABRATA; EVOLUTIONARY HISTORY; GENOME DOUBLING; LOCAL OPTIMIZATIONS; MINIMUM EVOLUTION; MULTI-DIMENSIONAL SCALING;

GENES;

EID: 46249099578     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btn146     Document Type: Article

References (22)

1. Bergeron,A. et al.(2006) A unifying view of genome rearrangements. In Bücher,P. and Moret,BM.E. (eds) Algorithms in Bioinformatics. Proceedings of WABI 2006. Lecture Notes in Computer Science 4175, Springer, Berlin. pp. 163-173.
2. Bourque,G and Pevzner,P. (2002) Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12, 26-36.
3. Bryant,D. (1998) The complexity of the breakpoint median problem. Technical Report CRM-2579, Centre de recherches mathématiques, Université de Montréal. Montreal, Canada.
4. Byrne,KP. and Wolfe,KH. (2005) The Yeast Gene Order Browser: Combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Res., 15, 1456-61.
5. Caprara,A. (2003) The reversals median problem. INFORMS J. Comput. 15, 93-113.
6. Choi,V. et al. (2007) Algorithms for the extraction of synteny blocks from comparative maps. In Giancarlo,R. and Hannenhalli,S. (eds) Proceedings of the WABI 2007 Workshop on Algorithms in Bioinformatics. Lecture Notes in Bioinformatics 4645. Springer, Heidelberg. pp. 277-288.
7. Dujon,B. et al. (2004) Genome evolution in yeasts. Nature, 430, 35-44.
8. El-Mabrouk,N. and Sankoff,D. (2003) The reconstruction of doubled genomes. SIAM J. Comput., 32, 754-92.
9. El-Mabrouk,N. et al.(1999) Reconstructing the pre-doubling genome. In Istrail,S., Pevzner,P. and Waterman,M. (eds) Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB 99). ACM Press, New York, pp. 154-163.
10. Goffeau,A. et al.(1996) Life with 6000 genes. Science, 275, 1051-1052.
11. Gower,J.C. (1966) Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika, 53, 325-328.
12. GRAPPA (Genome Rearrangements Analysis under Parsimony and Other Phylogenetic Algorithms) Available at http://www.es.unm.edu/moret/ GRAPPA/. (Date last accessed May 2008)
13. Kurtzman,C.P. and Robnett,C.J. (2003) Pbylogenetic relationships among yeasts of the 'Saccharomyces complex' determined from multigene sequence analyses. FEMS Yeast Res., 3, 417-32.
14. Pe'er,I. and Shamir,R. (1998) The median problems for breakpoints are NP- complete. Electronic Colloquium on Computational Complexity Technical Report 98-071, Available at http://www.eccc.uni-trier.de/ eccc. (Date last accessed May 2008).
15. R Development Core Team. (2007) R: A language and environment for statistical computing. R Foundation for Statistical Computing. Available at http://www.R-project.org. (Date last accessed May 2008).
16. Sankoff,D. et al.(2007) Polyploids, genome halving and phylogeny. Bioinformatics, 23, i433-i439.
17. Tesler,G. (2002) Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci., 65, 587-609.
18. Wolfe,K.H. and Shields,D.C. (1997) Molecular evidence for an ancient duplication of the entire yeast genome. Nature, 387, 708-713.
19. Yancopoulos,S. et al.(2005) Efficient sorting of genomic permutations by translocation, inversion, and block interchange. Bioinformatics, 21, 3340-3346.
20. Zheng,C. et al.(2006) Genome halving with an outgroup. Evol. Bioinform., 2, 319-326.
21. Zheng,C. et al.(2007a) Removing noise and ambiguities from comparative maps in rearrangement analysis. Trans. Comput. Biol. Bioinform., 4, 515-522.
22. Zheng,C. et al. (2007b) Parts of the problem of polyploids in rearrangement phylogeny. In Tesler,G. and Durand,D. (eds) Proceedings of the RECOMB 2007 Workshop on Comparative Genomics. Lecture Notes in Computer Science 4751, Springer, New York. pp. 162-176.