Abstract
Background: Binning of metagenomic reads is an active area of research, and many unsupervised machine learning-based techniques have been used for taxonomic independent binning of metagenomic reads.
Objective: It is important to find the optimum number of the cluster as well as develop an efficient pipeline for deciphering the complexity of the microbial genome.
Methods: Applying unsupervised clustering techniques for binning requires finding the optimal number of clusters beforehand and is observed to be a difficult task. This paper describes a novel method, MetaConClust, using coverage information for grouping of contigs and automatically finding the optimal number of clusters for binning of metagenomics data using a consensus-based clustering approach. The coverage of contigs in a metagenomics sample has been observed to be directly proportional to the abundance of species in the sample and is used for grouping of data in the first phase by MetaConClust. The Partitioning Around Medoid (PAM) method is used for clustering in the second phase for generating bins with the initial number of clusters determined automatically through a consensus- based method.
Results: Finally, the quality of the obtained bins is tested using silhouette index, rand Index, recall, precision, and accuracy. Performance of MetaConClust is compared with recent methods and tools using benchmarked low complexity simulated and real metagenomic datasets and is found better for unsupervised and comparable for hybrid methods.
Conclusion: This is suggestive of the proposition that the consensus-based clustering approach is a promising method for automatically finding the number of bins for metagenomics data.
Keywords: Binning, consensus clustering, coverage, PAM, unsupervised clustering, metagenomics.
Graphical Abstract
[http://dx.doi.org/10.1128/MMBR.68.4.669-685.2004] [PMID: 15590779]
[http://dx.doi.org/10.1186/1471-2105-9-386] [PMID: 18803844]
[http://dx.doi.org/10.1016/j.csbj.2016.11.005] [PMID: 27980708]
[http://dx.doi.org/10.1101/gr.5969107] [PMID: 17255551]
[http://dx.doi.org/10.1038/nmeth.2066] [PMID: 22688413]
[http://dx.doi.org/10.1186/gb-2014-15-3-r46] [PMID: 24580807]
[http://dx.doi.org/10.1186/s12864-015-1419-2] [PMID: 25879410]
[http://dx.doi.org/10.1186/s12859-019-2904-4] [PMID: 31757198]
[http://dx.doi.org/10.1186/1471-2105-5-163] [PMID: 15507136]
[http://dx.doi.org/10.1089/cmb.2010.0245] [PMID: 21385052]
[http://dx.doi.org/10.1007/978-3-540-78839-3_3]
[http://dx.doi.org/10.1186/1471-2105-10-316] [PMID: 19799776]
[http://dx.doi.org/10.1186/1471-2105-11-544] [PMID: 21044341]
[http://dx.doi.org/10.1021/acs.estlett.9b00476]
[http://dx.doi.org/10.3390/math8050662]
[http://dx.doi.org/10.1038/srep24175] [PMID: 27067514]
[http://dx.doi.org/10.1093/bioinformatics/bts397] [PMID: 22962452]
[http://dx.doi.org/10.7717/peerj.603] [PMID: 25289188]
[http://dx.doi.org/10.7717/peerj.1165] [PMID: 26336640]
[PMID: 27256312]
[http://dx.doi.org/10.1093/jhered/92.4.371] [PMID: 11535656]
[http://dx.doi.org/10.1371/journal.pone.0031386] [PMID: 22384016]
[http://dx.doi.org/10.1101/gr.142315.112] [PMID: 22936250]
[http://dx.doi.org/10.1186/s12859-017-1967-3] [PMID: 29297295]
[http://dx.doi.org/10.1093/nar/25.12.2430] [PMID: 9171096]
[http://dx.doi.org/10.1023/A:1023949509487]