Encoding Unitig-level Assembly Graphs with Heterophilous Constraints for Metagenomic Contigs Binning
Hansheng Xue, Vijini Mallawaarachchi, Lexing Xie, Vaibhav Rajan
Abstract
Metagenomics studies genomic material derived from mixed microbial communities in diverse environments, holding considerable significance for both human health and environmental sustainability. Metagenomic binning refers to the clustering of genomic subsequences obtained from high-throughput DNA sequencing into distinct bins, each representing a constituent organism within the community. Mainstream binning methods primarily rely on sequence features such as composition and abundance, making them unable to effectively handle sequences shorter than 1,000 bp and inherent noise within sequences. Several binning tools have emerged, aiming to enhance binning outcomes by using the assembly graph generated by assemblers, which encodes valuable overlapping information among genomic sequences. However, existing assembly graph-based binners mainly focus on simplified contig-level assembly graphs that are recreated from assembler's original graphs, unitig-level assembly graphs. The simplification reduces the resolution of the connectivity information in original graphs. In this paper, we design a novel binning tool named UNITIGBIN, which leverages representation learning on unitig-level assembly graphs while adhering to heterophilous constraints imposed by single-copy marker genes, ensuring that constrained contigs cannot be grouped together. Extensive experiments conducted on synthetic and real datasets demonstrate that UNITIGBIN significantly surpasses state-of-the-art binning tools.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f46bc05a-619e-400b-a5fe-2fded7b0074dBuilds on2
- RepBin: Constraint-Based Graph Representation Learning for Metagenomic BinningHansheng Xue, Vijini Mallawaarachchi, Yujia Zhang, Vaibhav Rajan et al.AAAI 2022 · 18 citations
- Metagenomic Binning using Connectivity-constrained Variational AutoencodersAndre Lamurias, Alessandro Tibo, Katja Hose, Mads Albertsen et al.ICML 2023 · 12 citations
Related papers
- Revisiting K-mer Profile for Effective and Scalable Genome Representation LearningAbdulkadir Çelikkanat, Andrés R. Masegosa, Thomas D. NielsenNeurIPS 2024 · 9 citations
- Accelerating large scale de novo metagenome assembly using GPUsMuaaz Gul Awan, Steven Hofmeyr, Rob Egan, Nan Ding et al.SC 2021 · 6 citations
- Minimizing Congestion for Balanced DominatorsYosuke Mizutani, Annie Staker, Blair D. SullivanKDD 2022
- MegIS: High-Performance, Energy-Efficient, and Low-Cost Metagenomic Analysis with In-Storage ProcessingNika Mansouri-Ghiasi, Mohammad Sadrosadati, Harun Mustafa, Arvid Gollwitzer et al.ISCA 2024 · 15 citations
- Finer Metagenomic Reconstruction via Biodiversity OptimizationSimon Foucart, David KoslickiNeurIPS 2020 · 1 citation
