BinSanity: Unsupervised Clustering of Environmental Microbial Assemblies Using Coverage and Affinity Propagation
Abstract
Metagenomics has become an integral part of defining microbial diversity in various environments. Many ecosystems have characteristically low biomass and few cultured representatives. Linking potential metabolisms to phylogeny in environmental microorganisms is important for interpreting microbial community functions and the impacts these communities have on geochemical cycles. However, with metagenomic studies there is the computational hurdle of binning contigs into phylogenetically related units or putative genomes. Binning methods have been implemented with varying approaches such as k-means clustering, Gaussian mixture models, hierarchical clustering, neural networks, and two-way clustering; however, many of these suffer from biases against low coverage/abundance organisms and closely related taxa/strains. We are introducing a new binning method, BinSanity, that utilizes the clustering algorithm affinity propagation (AP), to cluster assemblies using coverage alone, removing potential composition based biases in clustering contigs, but requires a minimum of two samples. To increase fidelity, a refinement script was developed that uses composition data (tetranucleotide frequency and %G+C content) to refine bins containing multiple source organisms. This separation of composition and coverage based signatures reduces clustering bias for closely related taxa. BinSanity was developed and tested on artificial metagenomes varying in size and complexity. Results indicate that this implementation of AP lead to a higher precision, recall, and Adjusted Rand Index over five commonly implemented methods. When tested on a previously published infant gut metagenome, BinSanity generated high completion and low redundancy bins corresponding with the published metagenome-assembled genomes.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility 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
- CoCoBin: Graph-Based Metagenomic Binning via Composition-Coverage Separation
Khuanwara - Potiwara, Duangdao Wichadakul·bioRxiv·Aug 27, 2025
- MetaCoAG: Binning Metagenomic Contigs via Composition, Coverage and Assembly Graphs
Vijini Mallawaarachchi, Yu Lin·Journal of Computational BiologyPeer-reviewed·Nov 11, 2022
- binny: an automated binning algorithm to recover high-quality genomes from complex metagenomic datasets
Oskar Hickl, Pedro Queirós, … Anna Heintz‐Buschart·Briefings in BioinformaticsPeer-reviewed·Sep 7, 2022
- MetaBinner: a high-performance and stand-alone ensemble binning method to recover individual genomes from complex microbial communities
Ziye Wang, Pingqin Huang, … Shanfeng Zhu·Genome biologyPeer-reviewed·Jan 6, 2023
- Automated refinement of metagenomic bins and estimation of binning success using itBins
Julian M. Künkel, Till L. V. Bornemann, … Alexander J. Probst·bioRxiv·Apr 1, 2026
- Binette: a fast and accurate bin refinement tool to construct high quality Metagenome Assembled Genomes.
Jean Mainguy, Claire Hoede·The Journal of Open Source SoftwarePeer-reviewed·Oct 5, 2024