Graph Neural Networks for Microbial Genome Recovery
Andre Lamurias, Alessandro Tibo, Katja Hose, Mads Albertsen, Thomas, Dyhre Nielsen

TL;DR
This paper introduces VaeG-Bin, a novel graph neural network-based method that improves microbial genome recovery from metagenomic data by leveraging assembly graph information.
Contribution
It combines variational autoencoders with GNNs to enhance contig representation learning for better genome binning in metagenomics.
Findings
VaeG-Bin outperforms existing binning methods on simulated datasets.
VaeG-Bin recovers more high-quality genomes from real-world datasets.
The approach effectively utilizes assembly graph structure for improved results.
Abstract
Microbes have a profound impact on our health and environment, but our understanding of the diversity and function of microbial communities is severely limited. Through DNA sequencing of microbial communities (metagenomics), DNA fragments (reads) of the individual microbes can be obtained, which through assembly graphs can be combined into long contiguous DNA sequences (contigs). Given the complexity of microbial communities, single contig microbial genomes are rarely obtained. Instead, contigs are eventually clustered into bins, with each bin ideally making up a full genome. This process is referred to as metagenomic binning. Current state-of-the-art techniques for metagenomic binning rely only on the local features for the individual contigs. These techniques therefore fail to exploit the similarities between contigs as encoded by the assembly graph, in which the contigs are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenomics and Phylogenetic Studies · Machine Learning in Bioinformatics · Bioinformatics and Genomic Networks
