Back

Gfa2bin enables graph-based GWAS by converting genome graphs to pan-genomic genotypes

Vorbrugg, S.; Bezrukov, I.; Bao, Z.; Xian, W.; Weigel, D.

2024-12-09 bioinformatics
10.1101/2024.12.05.626966 bioRxiv
Show abstract

Variation graphs offer superior representation of genomic diversity compared to traditional linear reference genomes, capturing complex features that are otherwise inaccessible to analysis. It seems self-evident that integrating these graphs with genome-wide association studies (GWAS) should enable more comprehensive understanding of genetic landscapes, potentially uncovering novel associations between genetic variations and traits. This approach takes full advantage of rich genomic information, thereby providing deeper insights into the genetic base of complex traits. Our tool, gfa2bin, offers multiple methods to (i) genotype variation graphs and (ii) convert the genotypes to well-established data formats for genome-wide association studies (GWAS). We demonstrate that variation graphs are feasible alternatives to traditional linear references for GWAS. Our case study using Arabidopsis thaliana and 1,695 traits shows that our approach complements SNP-based approaches, often identifying additional associations, with all associations having on average higher significance compared to SNP-based approaches. gfa2bin is implemented in Rust. Commented source code is available under MIT license at https://github.com/MoinSebi/gfa2bin. Examples of how to run gfa2bin are provided in the documentation. We added several Python scripts and a Snakemake pipeline for easy processing of our tool using larger data sets. In addition, we recommend using packing (https://github.com/MoinSebi/packing) for reduced storage and preprocessing (normalization) of sequence-to-graph alignments coverage.

Matching journals

The top 5 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.