BioinformaticsGeneticsPeer-reviewed journal article
CALDERA: Finding all significant de Bruijn subgraphs for bacterial GWAS
Hector Roux de BézieuxiD, Leandro LimaiD, Fanny PerraudeauiD, Arnaud MaryiD, Sandrine DudoitiD, Laurent JacobiD
Abstract
Genome wide association studies (GWAS), aiming to find genetic variants associated with a trait, have widely been used on bacteria to identify genetic determinants of drug resistance or hypervirulence. Recent bacterial GWAS methods usually rely on k-mers, whose presence in a genome can denote variants ranging from single nucleotide polymorphisms to mobile genetic elements. Since many bacterial species include genes that are not shared among all strains, this approach avoids the reliance on a common reference genome. However, the same gene can exist in slightly different versions across different strains, leading to diluted effects when trying to detect its association to a phenotype through k-mer based GWAS. Here we propose to overcome this by testing covariates built from closed connected subgraphs of the De Bruijn graph defined over genomic k-mers. These covariates are able to capture polymorphic genes as a single entity, improving k-mer based GWAS in terms of power and interpretability. As the number of subgraphs is exponential in the number of nodes in the DBG, a method naively testing all possible subgraphs would result in very low statistical power due to multiple testing corrections, and the mere exploration of these subgraphs would quickly become computationally intractable. The concept of testable hypothesis has successfully been used to address both problems in similar contexts. We leverage this concept to test all closed connected subgraphs by proposing a novel enumeration scheme for these objects which fully exploits the pruning opportunity offered by testability, resulting in drastic improvements in computational efficiency. We illustrate this on both real and simulated datasets and also demonstrate how considering subgraphs leads to a more powerful and interpretable method. Our method integrates with existing visual tools to facilitate interpretation. We also provide an implementation of our method, as well as code to reproduce all results at https://github.com/HectorRDB/Caldera_Recomb.
- organism: bacteria (other)
- assay: whole-genome sequencing
- research focus: GWAS / association mapping
- research focus: benchmarking
- approach: statistical model
- Citations
- 13
- FWCI
- 0.90
- Field percentile
- top 31%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- A fast and agnostic method for bacterial genome-wide association studies: bridging the gap between kmers and genetic events
Magali Jaillard, Leandro Lima, … Laurent Jacob·PLoS GeneticsPeer-reviewed·Nov 12, 2018
- Representing Genetic Determinants in BacterialGWAS with Compacted De Bruijn Graphs
Magali Jaillard, Maud Tournoud, … Laurent Jacob·bioRxiv·Mar 3, 2017
- Improved interpretability of bacterial genome-wide associations using gene cluster centric k-mers
Hannes Neubauer, Marco Galardini·bioRxiv·Apr 11, 2023
- Integrating long-range connectivity information into de Bruijn graphs
Isaac Turner, Kiran V. Garimella, … Gil McVean·BioinformaticsPeer-reviewed·Mar 15, 2018
- Extremely-fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
Andrea Cracco, Alexandru Ioan Tomescu·Genome ResearchPeer-reviewed·May 30, 2023
- PAN-GWES: Pangenome-spanning epistasis and co-selection analysis via de Bruijn graphs
Juri Kuronen, Samuel Horsfield, … Jukka Corander·Genome ResearchPeer-reviewed·Jul 1, 2024