http://kaiju.binf.ku.dk/ - Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein...
compbio.cs.toronto.edu - Scarpa is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate...
RAST – Web tool (upload contigs), uses the subsystems in the SEED database and provides detailed annotation and pathway analysis. Takes several hours per genome but I think this is the best way to get a high quality annotation...
mitos.bioinf.uni-leipzig.de - Allows automatic annotation of metazoan mitochondrial genomes. MITOS is a pipeline designed to compute a consistent de novo annotation of the mitogenomic sequences. The software allows for a systematic error screening, the standardisation of gene...
omega.omicsbio.org - Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph...
In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.
github.com - A de novo genome assembly can be summarised b
y a number of metrics, including:
Overall assembly length
Number of scaffolds/contigs
Length of longest scaffold/contig
Scaffold/contig N50 and N90Assembly base composition, in...
http://assemblytics.com/ - Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems
Optional: Gzip...
murasaki.dna.bio.keio.ac.jp - Murasaki is an anchor alignment program that is
exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))
scalable (Arbitrarily parallelizable across multiple...