Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Toronto

$17,000.00

Computational Methods for Detecting Multi-gene Relationships in Gene Expression Data

EF 2014-15

Résumé
Gene coexpression has emerged over the last several years as a powerful bioinformatics tool. Coexpressed genes may be involved in the same biological process, and thus coexpression networks are often used to investigate gene function. Methods for detecting, analyzing and clustering pairs of coexpressed genes are now well developed. Pairwise coexpression, however, is clearly too simplistic to describe the complex relationships between genes, since these relationships may involve multiple genes and can vary depending on the biological context. To address this limitation, we propose to develop computational methods for detecting and analyzing multi-gene relationships in gene expression data, and to use these methods to solve problems in molecular biology. These problems will include the reconstruction of genetic regulatory networks, the detection of modulators of gene regulation, and improved tools for gene function prediction.One of the main difficulties in detecting multi-gene relationships is the vast number of possible relationships which need to be considered. This is especially true in organisms with a large number of genes, such as plants and mammals. In such cases, separating the true relationships from the possible relationships poses challenging computational and statistical problems. To address these problems, we shall first develop methods of low computational complexity for detecting relatively simple multi-gene relationships. To avoid overfitting the data, we will develop methods for accurately estimating false positive rates. We will also develop heuristics for speeding up the computations while missing as few significant relationships as possible. To validate the methods, we will test them on both real and simulated gene expression data. Building upon these results, we will develop methods for detecting more-complex relationships involving larger numbers of genes.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
121360-2012
Name nom
Bonner, Anthony
Department département
Computer Science (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
17000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
3
Nb partie
5
Application title
Computational Methods for Detecting Multi-gene Relationships in Gene Expression Data
Keyword
NSERC
Application summary
Gene coexpression has emerged over the last several years as a powerful bioinformatics tool. Coexpressed genes may be involved in the same biological process, and thus coexpression networks are often used to investigate gene function. Methods for detecting, analyzing and clustering pairs of coexpressed genes are now well developed. Pairwise coexpression, however, is clearly too simplistic to describe the complex relationships between genes, since these relationships may involve multiple genes and can vary depending on the biological context. To address this limitation, we propose to develop computational methods for detecting and analyzing multi-gene relationships in gene expression data, and to use these methods to solve problems in molecular biology. These problems will include the reconstruction of genetic regulatory networks, the detection of modulators of gene regulation, and improved tools for gene function prediction.One of the main difficulties in detecting multi-gene relationships is the vast number of possible relationships which need to be considered. This is especially true in organisms with a large number of genes, such as plants and mammals. In such cases, separating the true relationships from the possible relationships poses challenging computational and statistical problems. To address these problems, we shall first develop methods of low computational complexity for detecting relatively simple multi-gene relationships. To avoid overfitting the data, we will develop methods for accurately estimating false positive rates. We will also develop heuristics for speeding up the computations while missing as few significant relationships as possible. To validate the methods, we will test them on both real and simulated gene expression data. Building upon these results, we will develop methods for detecting more-complex relationships involving larger numbers of genes.