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://kakitone.github.io/finishingTool/

Warning! This software is to be considered under development. Functionality and the user interface may still change significantly from one version to another. If you want to use this software, please stay up to date with the list of known issues:https://github.com/BinPro/CONCOCT/issues

Address of the bookmark: https://github.com/BinPro/CONCOCT

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

Hagfish requires a reference sequence and a paired end re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.

Quick links: Installation,Operation, Read mappers, Hagfish scripts, Hagfish plots

Address of the bookmark: https://github.com/mfiers/hagfish

Further information about LACHESIS, including source code, documentation and a user's guide are available at: http://shendurelab.github.io/LACHESIS.

Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#. Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions. Nature Biotechnology 2013 Dec;31(12):1119-25. doi: 10.1038/nbt.272. PubMed PMID: 24185095.

http://shendurelab.github.io/LACHESIS/

Address of the bookmark: http://shendurelab.github.io/LACHESIS/

The pipeline consists of three steps/modules:

• redundancy reduction: detection and selectively removal of redundant contigs from an initial de novo assembly
• scaffolding: joining of genome fragments using paired-end and/or mate-pairs reads
• gap closing

Redundans is:

• fast & lightweight, multi-core support and memory-optimised, so it can be run even on the laptop for small-to-medium size genomes
• flexible toward many sequencing technologies (Illumina, 454 or Sanger) and library types (paired-end, mate pairs, fosmids)
• modular: every step can be ommited or replaced by another tools

Address of the bookmark: https://github.com/Gabaldonlab/redundans

Download

Minia 2.0.7 Linux 64-bits binaries (Source code) (Legacy codebase)

For the impatient

A typical Minia command line looks like:

./minia -in reads.fa -kmer-size 31 -abundance-min 3 -out output_prefix

Type

./minia

for a quick explanation of the parameters.

For more information, refer to the manual.

KmerGenie can be used to determine the best k-mer size, minimum abundance of correct k-mers, and genome size estimation for your dataset.

Address of the bookmark: http://minia.genouest.org/

http://evomics.org/learning/assembly-and-alignment/velvet/

Address of the bookmark: http://evomics.org/learning/assembly-and-alignment/velvet/