Research map / Graph learning / Graph self-supervised learning
Encoding Unitig-level Assembly Graphs with Heterophilous Constraints for Metagenomic Contigs Binning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes a graph-based metagenomic contig binning method that encodes unitig-level assembly graphs with heterophilous constraints (abstract only; details unavailable).
Problem
Metagenomic binning clusters genomic subsequences (contigs) from high-throughput sequencing into bins, each representing one organism in a mixed microbial community.
Approach
Encodes unitig-level assembly graphs with heterophilous constraints for contig binning; the abstract does not give further detail on the mechanism.
Closest papers by meaning
- RepBin: Constraint-Based Graph Representation Learning for Metagenomic Binning (AAAI 2022 · similarity 0.92)
- Hyperbolic Genome Embeddings (ICLR 2025 · similarity 0.82)
- VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modeling (ICML 2024 · similarity 0.82)
- Modelling Microbial Communities with Graph Neural Networks (ICML 2024 · similarity 0.82)
- Whole Genome Transformer for Gene Interaction Effects in Microbiome Habitat Specificity (AAAI 2025 · similarity 0.82)
- DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genomes (ICLR 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.