Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université du Québec à Montréal

$24,000.00

New algorithms for the classification and visualisation of evolutionary and biomedical data

EF 2006-07

Résumé
My research proposal includes four major parts: 1. Species evolution has long been modeled using only phylogenetic trees. In such a tree, each species has a unique most recent ancestor, whereas other interspecies relationships, such as those caused by horizontal gene transfers or hybridization, cannot be represented. First, I propose to develop two methods, based on the distance and probabilistic approaches respectively, for the prediction and visualization of possible horizontal gene transfer events. The complete and partial gene transfer models allowing for a number of important evolutionary constraints will be considered. 2. Second, I intend to develop a method for the analysis and representation of reticulate evolution by hybrid networks. I will design an algorithm and corresponding software for computing the smallest number of hybridization events required to explain conflicting gene trees and develop an algorithm to determine whether an arbitrary rooted network can be realized by contemporaneous reticulation events. 3. Third, I propose to continue the investigation of the problem of phylogenetic inference from sequence data containing missing bases. A new effective approach allowing one to estimate unknown nucleotides prior to computing the evolutionary distances between them will be designed and tested in simulations. 4. My fourth objective consists of designing and implementing methods for studying and correcting high-throughput screening (HTS) data. High-throughput screening is an effective technology for drug discovery. I plan to develop two methods for adjusting the hit selection procedure during HTS experiments. The proposed techniques will allow researchers to minimize the impact of systematic error affecting the selection of potential drug targets.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
249644-2006
Name nom
Makarenkov, Vladimir
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
2006
Competition year année de concours
2006
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
1102
Area of application group en
Health, education and social services
Area of application group fr
Santé publique, éducation et services sociaux
Area of application en
Biomedical engineering
Area of application fr
Génie biomédical
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
1
Nb partie
5
Application title
New algorithms for the classification and visualisation of evolutionary and biomedical data
Keyword
NA
Application summary
My research proposal includes four major parts: 1. Species evolution has long been modeled using only phylogenetic trees. In such a tree, each species has a unique most recent ancestor, whereas other interspecies relationships, such as those caused by horizontal gene transfers or hybridization, cannot be represented. First, I propose to develop two methods, based on the distance and probabilistic approaches respectively, for the prediction and visualization of possible horizontal gene transfer events. The complete and partial gene transfer models allowing for a number of important evolutionary constraints will be considered. 2. Second, I intend to develop a method for the analysis and representation of reticulate evolution by hybrid networks. I will design an algorithm and corresponding software for computing the smallest number of hybridization events required to explain conflicting gene trees and develop an algorithm to determine whether an arbitrary rooted network can be realized by contemporaneous reticulation events. 3. Third, I propose to continue the investigation of the problem of phylogenetic inference from sequence data containing missing bases. A new effective approach allowing one to estimate unknown nucleotides prior to computing the evolutionary distances between them will be designed and tested in simulations. 4. My fourth objective consists of designing and implementing methods for studying and correcting high-throughput screening (HTS) data. High-throughput screening is an effective technology for drug discovery. I plan to develop two methods for adjusting the hit selection procedure during HTS experiments. The proposed techniques will allow researchers to minimize the impact of systematic error affecting the selection of potential drug targets.