benjjneb.github.io - The DADA2 tutorial goes through a typical workflow for paired end Illumina Miseq data: raw amplicon sequencing data is processed into the table of exact amplicon sequence variants (ASVs) present in each sample.
The DADA2...
github.com - Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version...
github.com - MEC, to identify and correct misassemblies in contigs. Firstly, MEC takes fragment coverage as the feature to detect the candidate misassemblies. Then, it can distinguish a large number of false positives from the candidate misassemblies based on...
github.com - LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.
The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then...
Illumina, the company that claims it brought human genome sequencing down to $1000 prices, has now turned its attention to a consumer product - a chip that you can plug into your smartphone and have it read your genetic information.
github.com - BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.
The BFC algorithm is a...
www.melbournebioinformatics.org.au - Written and maintained by Simon Gladman - Melbourne Bioinformatics (formerly VLSCI)
Protocol Overview / Introduction
In this protocol we discuss and outline the process of de novo assembly for small to medium sized...
Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...
github.com - Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After...