CH-Bin: A convex hull based approach for binning metagenomic contigs

被引:3
作者
Chandrasiri, Sunera [1 ]
Perera, Thumula [1 ]
Dilhara, Anjala [1 ]
Perera, Indika [1 ]
Mallawaarachchi, Vijini [2 ,3 ]
机构
[1] Univ Moratuwa, Dept Comp Sci & Engn, Moratuwa 10400, Sri Lanka
[2] Australian Natl Univ, Sch Comp, Canberra, ACT 2600, Australia
[3] Flinders Univ S Australia, Flinders Accelerator Microbiome Explorat, Bedford Pk, SA 5042, Australia
基金
美国国家卫生研究院;
关键词
Convex hull; Convex hull distance; Metagenomic binning; Multiple k values; High dimensional data clustering; Clustering algorithm; CLASSIFICATION; SEQUENCES; GENOMES; ALGORITHM; COVERAGE;
D O I
10.1016/j.compbiolchem.2022.107734
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Metagenomics has enabled culture-independent analysis of micro-organisms present in environmental samples. Metagenomics binning, which involves the grouping of contigs into bins that represent different taxonomic groups, is an important step of a typical metagenomic workflow followed after assembly. The majority of the metagenomic binning tools represent the composition and coverage information of contigs as feature vectors consisting of a large number of dimensions. However, these tools use traditional Euclidean distance or Manhattan distance metrics which become unreliable in the high dimensional space. We propose CH-Bin, a binning approach that leverages the benefits of using convex hull distance for binning contigs represented by high dimensional feature vectors. We demonstrate using experimental evidence on simulated and real datasets that the use of high dimensional feature vectors to represent contigs can preserve additional information, and result in improved binning results. We further demonstrate that the convex hull distance based binning approach can be effectively utilized in binning such high dimensional data. To the best of our knowledge, this is the first time that composition information from oligonucleotides of multiple sizes has been used in representing the composition information of contigs and a convex hull distance based binning algorithm has been used to bin metagenomic contigs. The source code of CH-Bin is available at https://github.com/kdsuneraavinash/CH-Bin.
引用
收藏
页数:9
相关论文
共 56 条
[51]   MaxBin 2.0: an automated binning algorithm to recover genomes from multiple metagenomic datasets [J].
Wu, Yu-Wei ;
Simmons, Blake A. ;
Singer, Steven W. .
BIOINFORMATICS, 2016, 32 (04) :605-607
[52]   MaxBin: an automated binning method to recover individual genomes from metagenomes using an expectation-maximization algorithm [J].
Wu, Yu-Wei ;
Tang, Yung-Hsu ;
Tringe, Susannah G. ;
Simmons, Blake A. ;
Singer, Steven W. .
MICROBIOME, 2014, 2
[53]   A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-tuples [J].
Wu, Yu-Wei ;
Ye, Yuzhen .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (03) :523-534
[54]   BMC3C: binning metagenomic contigs using codon usage, sequence composition and read coverage [J].
Yu, Guoxian ;
Jiang, Yuan ;
Wang, Jun ;
Zhang, Hao ;
Luo, Haiwei .
BIOINFORMATICS, 2018, 34 (24) :4172-4179
[55]   Integrative analyses of targeted metabolome and transcriptome of Isatidis Radix autotetraploids highlighted key polyploidization-responsive regulators [J].
Zhang, Zixuan ;
Tan, Mingpu ;
Zhang, Yingying ;
Jia, Yue ;
Zhu, Shuxian ;
Wang, Jiang ;
Zhao, Jiajing ;
Liao, Yueyue ;
Xiang, Zengxu .
BMC GENOMICS, 2021, 22 (01)
[56]  
Zhou XF, 2009, LECT NOTES COMPUT SC, V5545, P570, DOI 10.1007/978-3-642-01973-9_64