Binning (metagenomics)

In metagenomics, binning is the process of grouping reads or contigs and assigning them to individual genome. Binning methods can be based on either compositional features or alignment (similarity), or both.^[1]

Introduction

Metagenomic samples can contain reads from a huge number of organisms. For example, in a single gram of soil, there can be up to 18000 different types of organisms, each with its own genome.^[2] Metagenomic studies sample DNA from the whole community, and make it available as nucleotide sequences of certain length. In most cases, the incomplete nature of the obtained sequences makes it hard to assemble individual genes,^[3] much less recovering the full genomes of each organism. Thus, binning techniques represent a "best effort" to identify reads or contigs within certain genomes known as Metagenome Assembled Genome (MAG). Taxonomy of MAGs can be inferred through placement into a reference phylogenetic tree using algorithms like GTDB-Tk.^[4]

The first studies that sampled DNA from multiple organisms used specific genes to assess diversity and origin of each sample.^[5][6] These marker genes had been previously sequenced from clonal cultures from known organisms, so, whenever one of such genes appeared in a read or contig from the metagenomic sample that read could be assigned to a known species or to the OTU of that species. The problem with this method was that only a tiny fraction of the sequences carried a marker gene, leaving most of the data unassigned.

Modern binning techniques use both previously available information independent from the sample and intrinsic information present in the sample. Depending on the diversity and complexity of the sample, their degree of success vary: in some cases they can resolve the sequences up to individual species, while in some others the sequences are identified at best with very broad taxonomic groups.^[7]

Binning of metagenomic data from various habitats might significantly extend the tree of life. Such approach on globally available metagenomes binned 52 515 individual microbial genomes and extended diversity of bacteria and archaea by 44%.^[8]

Algorithms

Binning algorithms can employ previous information, and thus act as supervised classifiers, or they can try to find new groups, those act as unsupervised classifiers. Many, of course, do both. The classifiers exploit the previously known sequences by performing alignments against databases, and try to separate sequence based in organism-specific characteristics of the DNA,^[9] like GC-content.

Mande et al., (2012) ^[10] provides a review of the premise, methodologies, advantages, limitations and challenges of various methods available for binning of metagenomic datasets obtained using the shotgun sequencing approach. Some of the prominent binning algorithms are described below.

TETRA

TETRA is a statistical classifier that uses tetranucleotide usage patterns in genomic fragments.^[11] There are four possible nucleotides in DNA, therefore there can be [math]\displaystyle{ 4^4=256 }[/math] different fragments of four consecutive nucleotides; these fragments are called tetramers. TETRA works by tabulating the frequencies of each tetramer for a given sequence. From these frequencies z-scores are then calculated, which indicate how over- or under-represented the tetramer is in contraposition with what would be expected by looking to individual nucleotide compositions. The z-scores for each tetramer are assembled in a vector, and the vectors corresponding to different sequences are compared pair-wise, to yield a measure of how similar different sequences from the sample are. It is expected that the most similar sequences belong to organisms in the same OTU.

MEGAN

In the DIAMOND^[12]+MEGAN^[13] approach, all reads are first aligned against a protein reference database, such as NCBI-nr, and then the resulting alignments are analyzed using the naive LCA algorithm, which places a read on the lowest taxonomic node in the NCBI taxonomy that lies above all taxa to which the read has a significant alignment. Here, an alignment is usually deemed "significant", if its bit score lies above a given threshold (which depends on the length of the reads) and is within 10%, say, of the best score seen for that read. The rationale of using protein reference sequences, rather than DNA reference sequences, is that current DNA reference databases only cover a small fraction of the true diversity of genomes that exist in the environment.

Phylopythia

Phylopythia is one supervised classifier developed by researchers at IBM labs, and is basically a support vector machine trained with DNA k-mers from known sequences.^[6]

SOrt-ITEMS

SOrt-ITEMS (Monzoorul et al., 2009) ^[14] is an alignment-based binning algorithm developed by Innovations Labs of Tata Consultancy Services (TCS) Ltd., India. Users need to perform a similarity search of the input metagenomic sequences (reads) against the nr protein database using BLASTx search. The generated BLASTx output is then taken as input by the SOrt-ITEMS program. The method uses a range of BLAST alignment parameter thresholds to first identify an appropriate taxonomic level (or rank) where the read can be assigned. An orthology-based approach is then adopted for the final assignment of the metagenomic read. Other alignment-based binning algorithms developed by the Innovation Labs of Tata Consultancy Services (TCS) include DiScRIBinATE,^[15] ProViDE ^[16] and SPHINX.^[17] The methodologies of these algorithms are summarized below.

DiScRIBinATE

DiScRIBinATE (Ghosh et al., 2010) ^[15] is an alignment-based binning algorithm developed by the Innovations Labs of Tata Consultancy Services (TCS) Ltd., India. DiScRIBinATE replaces the orthology approach of SOrt-ITEMS with a quicker 'alignment-free' approach. Incorporating this alternate strategy was observed to reduce the binning time by half without any significant loss in the accuracy and specificity of assignments. Besides, a novel reclassification strategy incorporated in DiScRIBinATE was seem to reduce the overall misclassification rate.

ProViDE

ProViDE (Ghosh et al., 2011) ^[16] is an alignment-based binning approach developed by the Innovation Labs of Tata Consultancy Services (TCS) Ltd. for the estimation of viral diversity in metagenomic samples. ProViDE adopts the reverse orthology based approach similar to SOrt-ITEMS for the taxonomic classification of metagenomic sequences obtained from virome datasets. It a customized set of BLAST parameter thresholds, specifically suited for viral metagenomic sequences. These thresholds capture the pattern of sequence divergence and the non-uniform taxonomic hierarchy observed within/across various taxonomic groups of the viral kingdom.

PCAHIER

PCAHIER (Zheng et al., 2010),^[18] another binning algorithm developed by the Georgia Institute of Technology., employs n-mer oligonucleotide frequencies as the features and adopts a hierarchical classifier (PCAHIER) for binning short metagenomic fragments. The principal component analysis was used to reduce the high dimensionality of the feature space. The effectiveness of the PCAHIER was demonstrated through comparisons against a non-hierarchical classifier, and two existing binning algorithms (TETRA and Phylopythia).

SPHINX

SPHINX (Mohammed et al., 2011),^[17] another binning algorithm developed by the Innovation Labs of Tata Consultancy Services (TCS) Ltd., adopts a hybrid strategy that achieves high binning efficiency by utilizing the principles of both 'composition'- and 'alignment'-based binning algorithms. The approach was designed with the objective of analyzing metagenomic datasets as rapidly as composition-based approaches, but nevertheless with the accuracy and specificity of alignment-based algorithms. SPHINX was observed to classify metagenomic sequences as rapidly as composition-based algorithms. In addition, the binning efficiency (in terms of accuracy and specificity of assignments) of SPHINX was observed to be comparable with results obtained using alignment-based algorithms.

INDUS and TWARIT

Represent other composition-based binning algorithms developed by the Innovation Labs of Tata Consultancy Services (TCS) Ltd. These algorithms utilize a range of oligonucleotide compositional (as well as statistical) parameters to improve binning time while maintaining the accuracy and specificity of taxonomic assignments.^[19][20]

Other algorithms

This list is not exhaustive:

• TACOA (Diaz et al., 2009)
• Parallel-META (Su et al., 2011)
• PhyloPythiaS (Patil et al., 2011)
• RITA (MacDonald et al., 2012)^[21]
• BiMeta (Le et al., 2015) ^[22]
• MetaPhlAn (Segata et al., 2012)^[23]
• SeMeta (Le et al., 2016) ^[24]
• Quikr (Koslicki et al., 2013)^[25]

• Taxoner (Pongor et al., 2014)^[26]
• MaxBin (Wu et al., 2014)^[27]
• MetaBAT 2 (Kang et al., 2019)^[28]
• CONCOCT (Alneberg et al., 2014)^[29]
• Anvi’o (Eren et al., 2015)^[30]
• DAS Tool (Sieber et al., 2018)^[31] - wrapper that combines multiple binning algorithms

All these algorithms employ different schemes for binning sequences, such as hierarchical classification, and operate in either a supervised or unsupervised manner. These algorithms provide a global view of how diverse the samples are, and can potentially connect community composition and function in metagenomes.

References

• Schloss, Patrick D; Jo Handelsman (2006-07-21). "Toward a Census of Bacteria in Soil". PLOS Comput Biol 2 (7): e92. doi:10.1371/journal.pcbi.0020092. PMID 16848637. Bibcode: 2006PLSCB...2...92S. 

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Binning (metagenomics). Read more