» Articles » PMID: 33947431

Improving Metagenomic Binning Results with Overlapped Bins Using Assembly Graphs

Overview
Publisher Biomed Central
Date 2021 May 5
PMID 33947431
Citations 9
Authors
Affiliations
Soon will be listed here.
Abstract

Background: Metagenomic sequencing allows us to study the structure, diversity and ecology in microbial communities without the necessity of obtaining pure cultures. In many metagenomics studies, the reads obtained from metagenomics sequencing are first assembled into longer contigs and these contigs are then binned into clusters of contigs where contigs in a cluster are expected to come from the same species. As different species may share common sequences in their genomes, one assembled contig may belong to multiple species. However, existing tools for binning contigs only support non-overlapped binning, i.e., each contig is assigned to at most one bin (species).

Results: In this paper, we introduce GraphBin2 which refines the binning results obtained from existing tools and, more importantly, is able to assign contigs to multiple bins. GraphBin2 uses the connectivity and coverage information from assembly graphs to adjust existing binning results on contigs and to infer contigs shared by multiple species. Experimental results on both simulated and real datasets demonstrate that GraphBin2 not only improves binning results of existing tools but also supports to assign contigs to multiple bins.

Conclusion: GraphBin2 incorporates the coverage information into the assembly graph to refine the binning results obtained from existing binning tools. GraphBin2 also enables the detection of contigs that may belong to multiple species. We show that GraphBin2 outperforms its predecessor GraphBin on both simulated and real datasets. GraphBin2 is freely available at https://github.com/Vini2/GraphBin2 .

Citing Articles

Solving genomic puzzles: computational methods for metagenomic binning.

Mallawaarachchi V, Wickramarachchi A, Xue H, Papudeshi B, Grigson S, Bouras G Brief Bioinform. 2024; 25(5).

PMID: 39082646 PMC: 11289683. DOI: 10.1093/bib/bbae372.


PlasmidEC and gplas2: an optimized short-read approach to predict and reconstruct antibiotic resistance plasmids in .

Paganini J, Kerkvliet J, Vader L, Plantinga N, Meneses R, Corander J Microb Genom. 2024; 10(2).

PMID: 38376388 PMC: 10926690. DOI: 10.1099/mgen.0.001193.


Phables: from fragmented assemblies to high-quality bacteriophage genomes.

Mallawaarachchi V, Roach M, Decewicz P, Papudeshi B, Giles S, Grigson S Bioinformatics. 2023; 39(10).

PMID: 37738590 PMC: 10563150. DOI: 10.1093/bioinformatics/btad586.


Host interactions of novel species belonging to multiple families infecting bacterial host, WH2.

Papudeshi B, Vega A, Souza C, Giles S, Mallawaarachchi V, Roach M Microb Genom. 2023; 9(9).

PMID: 37665209 PMC: 10569736. DOI: 10.1099/mgen.0.001100.


Phables: from fragmented assemblies to high-quality bacteriophage genomes.

Mallawaarachchi V, Roach M, Decewicz P, Papudeshi B, Giles S, Grigson S bioRxiv. 2023; .

PMID: 37066369 PMC: 10104058. DOI: 10.1101/2023.04.04.535632.


References
1.
Ames S, Hysom D, Gardner S, Lloyd G, Gokhale M, Allen J . Scalable metagenomic taxonomy classification using a reference genome database. Bioinformatics. 2013; 29(18):2253-60. PMC: 3753567. DOI: 10.1093/bioinformatics/btt389. View

2.
Myers E . The fragment assembly string graph. Bioinformatics. 2005; 21 Suppl 2:ii79-85. DOI: 10.1093/bioinformatics/bti1114. View

3.
Simpson J, Durbin R . Efficient de novo assembly of large genomes using compressed data structures. Genome Res. 2011; 22(3):549-56. PMC: 3290790. DOI: 10.1101/gr.126953.111. View

4.
Gourle H, Karlsson-Lindsjo O, Hayer J, Bongcam-Rudloff E . Simulating Illumina metagenomic data with InSilicoSeq. Bioinformatics. 2018; 35(3):521-522. PMC: 6361232. DOI: 10.1093/bioinformatics/bty630. View

5.
Wu Y, Simmons B, Singer S . MaxBin 2.0: an automated binning algorithm to recover genomes from multiple metagenomic datasets. Bioinformatics. 2015; 32(4):605-7. DOI: 10.1093/bioinformatics/btv638. View