BOL

github.com - This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in: Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes Mads...

www.sanger.ac.uk - PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed: ABACAS, that is able to contiguate contigs from a de novo assembly against a closely related reference. IMAGE, an...

github.com - This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at kklam@eecs.berkeley.edu. My name is Ka-Kit...

github.com - GRAbB is shown to be more efficient than MITObim in terms of speed, memory and disk usage. The other functionalities (handling multiple targets simultaneously and extracting homologous regions) of the new program are not matched by other programs....

github.com - Allio, R., Schomaker-Bastos, A., Romiguier, J., Prosdocimi, F., Nabholz, B., & Delsuc, F. (2020) Mol Ecol Resour. 20, 892-905. (publication link) Mitofinder is a pipeline to assemble mitochondrial genomes...

github.com - Peregrine is a fast genome assembler for accurate long reads (length > 10kb, accuracy > 99%). It can assemble a human genome from 30x reads within 20 cpu hours from reads to polished consensus. It uses Sparse HIereachical MimiMizER (SHIMMER)...

github.com - CLAW (Chloroplast Long-read Assembly Workflow) is an mostly-automated Snakemake-based workflow for the assembly of chloroplast genomes. CLAW uses chloroplast long-reads, which are baited out of larger read libraries (e.g., an Oxford Nanopore...

sourceforge.net - Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies. Genome assembly projects typically run multiple algorithms in an attempt to find the single best...

github.com - NovoGraph: building whole genome graphs from long-read-based de novo assemblies An algorithmically novel approach to construct a genome graph representation of long-read-based de novo sequence assemblies. We then provide a proof of...

www.isical.ac.in - Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a...