CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2009 vol.6 Issue No.02 - April-June
Issue No.02 - April-June (2009 vol.6)
Qian Zhu , University of Ottawa, Ottawa
Zaky Adam , University of Ottawa, Ottawa
Vicky Choi , Virginia Tech, Blacksburg
David Sankoff , University of Ottawa, Ottawa
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.121
We present a parameterized definition of gene clusters that allows us to control the emphasis placed on conserved order within a cluster. Though motivated by biological rather than mathematical considerations, this parameter turns out to be closely related to the bandwidth parameter of a graph. Our focus will be on how this parameter affects the characteristics of clusters: how numerous they are, how large they are, how rearranged they are, and to what extent they are preserved from ancestor to descendant in a phylogenetic tree. We infer the latter property by dynamic programming optimization of the presence of individual edges at the ancestral nodes of the phylogeny. We apply our analysis to a set of genomes drawn from the Yeast Gene Order Browser.
Comparative genomics, gene clusters, yeast, evolution, phylogeny, genome rearrangements, graph bandwidth, dynamic programming, Saccharomyces cerevisiae, Candida glabrata, Ashbya gossypii, Kluyveromyces waltii, Kluyveromyces lactis.
Qian Zhu, Zaky Adam, Vicky Choi, David Sankoff, "Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, no. 2, pp. 213-220, April-June 2009, doi:10.1109/TCBB.2008.121