Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (>200kb) in 3 hours, where 621 genome bins are >50% complete with <5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.

Address of the bookmark: https://bitbucket.org/berkeleylab/metabat

Training Resources:

• Bioinformatics Workshop (Webinars)
• Bioinformatics Training Slides

Specialized Applications:

• De Novo Assembly
• Transcriptome analysis
• Base Modification Analysis
• Barcoding
• Data Analysis Tools
• Minor Variants and Phasing Analysis

Address of the bookmark: https://github.com/PacificBiosciences/Bioinformatics-Training/wiki

Address of the bookmark: http://abacas.sourceforge.net/Manual.html#9._Colour_code

Address of the bookmark: http://kakitone.github.io/finishingTool/

Address of the bookmark: http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3

To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics). Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers >40,000 CLG files of publicly available Bacterial and Archaeal genomes.

Address of the bookmark: https://chunlab.wordpress.com/clgenomics-software/

Address of the bookmark: http://seqmule.openbioinformatics.org/en/latest/

Computational methods used by the Shasta assembler include:

• Using a run-length representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.
• Using in some phases of the computation a representation of the read sequence based on markers, a fixed subset of short k-mers (k ≈ 10).

More at https://chanzuckerberg.github.io/shasta/index.html

Address of the bookmark: https://github.com/chanzuckerberg/shasta