Grant: Discovery Grants Program - Individual
Université du Québec à Montréal
$24,000.00
Algorithms in comparative genomics, transcriptome assembly, and metagenomics
EF 2013-14
Résumé
In this program, we will investigate three problems. Genomes of different species often share many genes, but these may occur in different orders in the genome sequence. Based on the principle that any two species share a common ancestor, the question of how to reconstruct the evolution of one genome into another, based on gene orders, have been studied intensively in recent years. One of the lingering problems is the difficulty of discriminating between the multitude of different evolution scenarios that are proposed by the current models. Based on previous results, we plan to find new answers by studying properties of special graphs associated to genome comparisons. In addition to this long term goal, we plan to rapidly develop software tools that can aid the construction of evolution scenarios.Our second problem is to develop algorithms to characterize all RNA molecules that are present in a cell at a given time. Recent technology allows us to easily get partial information on these molecules, but there is still a lack of software tools that can transform this data into sound results. Recently, we designed theoretical models that showed the limits of these approaches. Our next goal is to construct software tools that can deal with real situations.Our third goal is somewhat a mix of the first two, and probably the most challenging. In metagenomics surveys, many species are sequenced together because they live in the same environment, or are closely related species. We plan to generalize the approaches developed to characterize RNA molecules in the cell to this more complex problem, where rearrangements between close species will be identified.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
121768-2009
Name nom
Bergeron, Anne
Department département
Informatique
Organization id
57
Institution établissement
Université du Québec à Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2009
Award amount
24000
Program id
RGPIN
Program name 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
1201
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Life sciences (including biotechnology)
Area of application fr
Sciences de la vie (y compris biotechnologie)
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
5
Nb partie
5
Application title
Algorithms in comparative genomics, transcriptome assembly, and metagenomics
Keyword
NSERC
Application summary
In this program, we will investigate three problems. Genomes of different species often share many genes, but these may occur in different orders in the genome sequence. Based on the principle that any two species share a common ancestor, the question of how to reconstruct the evolution of one genome into another, based on gene orders, have been studied intensively in recent years. One of the lingering problems is the difficulty of discriminating between the multitude of different evolution scenarios that are proposed by the current models. Based on previous results, we plan to find new answers by studying properties of special graphs associated to genome comparisons. In addition to this long term goal, we plan to rapidly develop software tools that can aid the construction of evolution scenarios.Our second problem is to develop algorithms to characterize all RNA molecules that are present in a cell at a given time. Recent technology allows us to easily get partial information on these molecules, but there is still a lack of software tools that can transform this data into sound results. Recently, we designed theoretical models that showed the limits of these approaches. Our next goal is to construct software tools that can deal with real situations.Our third goal is somewhat a mix of the first two, and probably the most challenging. In metagenomics surveys, many species are sequenced together because they live in the same environment, or are closely related species. We plan to generalize the approaches developed to characterize RNA molecules in the cell to this more complex problem, where rearrangements between close species will be identified.