BOL

sourceforge.net - PBJelly - the genome upgrading tool. PBHoney - the structural variation discovery tool Both are contained within the PBSuite code found in downloads.----- PBJelly -----Read The...

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 metagenomesMads...

github.com - DBG2OLC:Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies Our work is published in Scientific Reports: Ye, C. et al. DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous...

bioinformatics.uconn.edu - This tutorial will serve as an example of how to use free and open-source genome assembly and secondary scaffolding tools to generate high quality assemblies of bacterial sequence data. The bacterial sample used in this tutorial will be...

github.com - Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of de novo genome assembly or...

shendurelab.github.io - LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly. Further information about LACHESIS, including source code, documentation and a user's guide are available...

github.com - Redundans pipeline assists an assembly of heterozygous genomes.Program takes as input assembled contigs, paired-end and/or mate pairs sequencing libraries and returns scaffolded homozygous genome assembly, that should...

minia.genouest.org - Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn...

evomics.org - The objective of this activity is to help you understand how to run Velvet in general, how to accurately estimate the insert size of a paired-end library through the use of Bowtie, the primary parameters of velvet, and the process...

sco.h-its.org - PEAR is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory. PEAR evaluates all possible paired-end read overlaps and without requiring the...