Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université de Montréal

$34,000.00

Development of reference-free algorithms for low coverage RNA-Seq characterization of cell states

EF 2023-24

Résumé
Since the early days of microarrays, transcriptomics had a central role in modern molecular biology by providing a rich and dynamic view of active molecular processes within cells. RNA-Seq is nowadays a routine methodology accessible to most academic laboratories and provides an infinitely richer view of the transcriptome when compared to microarrays. Analyses pipelines for RNA-Seq unfortunately discard precious observations present in the original data such as unannotated transcripts, gene splicing events or gene rearrangements. Using the resulting biased expression profiles to train artificial intelligence algorithms such as deep neural networks prevents them from reaching their full potential. We propose a most drastic reorganization of RNA-Seq data analysis around the use of k-mer count tables (KCTs) as purely data-driven summaries. As k-mers are short, fixed-length sequences associated with an expression value, they are the perfect input to deep neural networks. This representation retains a much wider range of features present in the transcriptome and could readily be applied to organisms in which the genome is unannotated. The main challenge brought by this representation is its size, easily reaching tens of millions of k-mers for a single experiment. Work on this program will proceed on three fronts. First, we will fully master the various intricacies of quantitatively representing transcriptomes using k-mer count tables. Of particular interest will be the determination of the optimal k-mer length and the identification of an appropriate normalization to account for the varying sequencing depth. This first step will be done to accommodate datasets of several thousands of samples. Second, we will extend a neural network-based algorithm developed in our laboratory, the factorized embedding to allow k-mer-based representations to be used as input. This algorithm has the property to return a short numerical vector that summarizes, as well as possible, all quantitative observations presented at the training stage. Third, we will take advantage of these numerical summaries as ideal input to a second layer of deep neural network that we will design and train to make useful predictions on represented samples. Typically these predictions will be phenotypes of interest of varying levels of complexity. Both the factorized embeddings and these neural networks will be trained on large and well-established, public RNA-Seq datasets. This program will open a whole new perspective on the analysis of RNA-Seq data, yielding high-performance, open source software tools for the transcriptomic user's community. These advances should be particularly transformative in fields studying less genetically characterized organisms. As we expect to confirm the sufficiency of very low depth RNA-Seq, this program will open applications where RNA-Seq has been deemed unaffordable.
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
RGPIN-2022-04260
Name nom
Lemieux, Sébastien
Department département
Biochemistry and Molecular Medicine
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2022
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1501
Committee name en
Genes, Cells and Molecules
Committee name fr
Gènes, cellules et molécules
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Learning and inference theories
Research subject en
Intelligence artificielle
Research subject fr
Théories de l'apprentissage et l'inférence
Application title
Development of reference-free algorithms for low coverage RNA-Seq characterization of cell states
Keyword
Bioinformatics; Computational biology; Deep neural network; k-mers; Machine learning; RNA-Seq; Transcriptomics
Application summary
Since the early days of microarrays, transcriptomics had a central role in modern molecular biology by providing a rich and dynamic view of active molecular processes within cells. RNA-Seq is nowadays a routine methodology accessible to most academic laboratories and provides an infinitely richer view of the transcriptome when compared to microarrays. Analyses pipelines for RNA-Seq unfortunately discard precious observations present in the original data such as unannotated transcripts, gene splicing events or gene rearrangements. Using the resulting biased expression profiles to train artificial intelligence algorithms such as deep neural networks prevents them from reaching their full potential. We propose a most drastic reorganization of RNA-Seq data analysis around the use of k-mer count tables (KCTs) as purely data-driven summaries. As k-mers are short, fixed-length sequences associated with an expression value, they are the perfect input to deep neural networks. This representation retains a much wider range of features present in the transcriptome and could readily be applied to organisms in which the genome is unannotated. The main challenge brought by this representation is its size, easily reaching tens of millions of k-mers for a single experiment. Work on this program will proceed on three fronts. First, we will fully master the various intricacies of quantitatively representing transcriptomes using k-mer count tables. Of particular interest will be the determination of the optimal k-mer length and the identification of an appropriate normalization to account for the varying sequencing depth. This first step will be done to accommodate datasets of several thousands of samples. Second, we will extend a neural network-based algorithm developed in our laboratory, the factorized embedding to allow k-mer-based representations to be used as input. This algorithm has the property to return a short numerical vector that summarizes, as well as possible, all quantitative observations presented at the training stage. Third, we will take advantage of these numerical summaries as ideal input to a second layer of deep neural network that we will design and train to make useful predictions on represented samples. Typically these predictions will be phenotypes of interest of varying levels of complexity. Both the factorized embeddings and these neural networks will be trained on large and well-established, public RNA-Seq datasets. This program will open a whole new perspective on the analysis of RNA-Seq data, yielding high-performance, open source software tools for the transcriptomic user's community. These advances should be particularly transformative in fields studying less genetically characterized organisms. As we expect to confirm the sufficiency of very low depth RNA-Seq, this program will open applications where RNA-Seq has been deemed unaffordable.