Grant: Discovery Grants Program - Individual
University of Ottawa
$66,000.00
Mathematical genomics
FY 2009-10
Summary
We study the mathematics, statistics and computing of genome rearrangements, the evolutionary processes by which segments of chromosomes are inverted, moved around and exchanged. There is an algorithmic technology for inferring a minimizing sequence of operations necessary to transform one genome into another, where the operations are modeled on processes such as inversion, reciprocal translocation, chromosome fusion and fission, transposition of chromosomal segments. Once these inferences are made, however, there is a need for some way to statistically validate both the inferences and the assumptions of the evolutionary model.
Our approach is to use models of random genomes to see to what extent there is an signal remaining in the comparative structure of the two genomes, or whether evolution has largely scrambled the order of each one with respect to the other.
We work on the problem of the rearrangement median for three genomes as the basis for gene order phylogeny based on rearrangements, and apply it to chloroplast and mammalian data sets.
We study the "genome halving problem" for ancient tetraploids and extensions to mixed ploidy gene order phylogenies. We apply this to the study of the "Saccharomyces complex" of yeast species.
In comparing genomic maps, we introduce the notion of partially ordered genomes to take into account missing and unresolved data, and use this to compare the genomes of various cereal species. We also work on distinguishing mapping errors from genuine rearrangements of the genomes and we apply this to the comparison of the rice and sorghum genomes.
We have defined a new measure of "generalized adjacency" as a useful tool in computing ancestral genomes within a phylogeny. This leads to many algorithmic and statistical questions we propose to investigate.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
8867-2008
Name nom
Sankoff, David
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2008
Award amount
66000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
5004
Research subject group en
Genetics
Research subject group fr
Génétique
Research subject en
Genome analysis
Research subject fr
Analyse du génome
Partie
2
Nb partie
5
Application title
Mathematical genomics
Keyword
NA
Application summary
We study the mathematics, statistics and computing of genome rearrangements, the evolutionary processes by which segments of chromosomes are inverted, moved around and exchanged. There is an algorithmic technology for inferring a minimizing sequence of operations necessary to transform one genome into another, where the operations are modeled on processes such as inversion, reciprocal translocation, chromosome fusion and fission, transposition of chromosomal segments. Once these inferences are made, however, there is a need for some way to statistically validate both the inferences and the assumptions of the evolutionary model.
Our approach is to use models of random genomes to see to what extent there is an signal remaining in the comparative structure of the two genomes, or whether evolution has largely scrambled the order of each one with respect to the other.
We work on the problem of the rearrangement median for three genomes as the basis for gene order phylogeny based on rearrangements, and apply it to chloroplast and mammalian data sets.
We study the "genome halving problem" for ancient tetraploids and extensions to mixed ploidy gene order phylogenies. We apply this to the study of the "Saccharomyces complex" of yeast species.
In comparing genomic maps, we introduce the notion of partially ordered genomes to take into account missing and unresolved data, and use this to compare the genomes of various cereal species. We also work on distinguishing mapping errors from genuine rearrangements of the genomes and we apply this to the comparison of the rice and sorghum genomes.
We have defined a new measure of "generalized adjacency" as a useful tool in computing ancestral genomes within a phylogeny. This leads to many algorithmic and statistical questions we propose to investigate.