BOL

Genome assembly pipeline !

github.com - Merfin, a k-mer based variant-filtering algorithm for improved accuracy in genotyping and genome assembly polishing. Merfin evaluates each variant based on the expected k-mer multiplicity in the reads, independently of the quality of the...

ratt.sourceforge.net - RATT is software to transfer annotation from a reference (annotated) genome to an unannotated query genome. It was first developed to transfer annotations between different genome assembly versions. However, it can also transfer annotations between...

mira-assembler.sourceforge.net - MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by electrophoresis sequencing (aka Sanger sequencing) 454 pyro-sequencing (GS20, FLX or Titanium) Ion...

www.bioinformatics.babraham.ac.uk - Understanding Following table and graphs Duplication level kmer profile per base GC content per base N content per base quality per base sequence content per sequence GC content per sequence quality sequence length distribution More at...

www.cbcb.umd.edu - Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with...

github.com - Requirements: velvet (velveth velvetg should be in your PATH) R (with Sweave) pdflatex (usually part of TeTeX) ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable")) Perl Optional: BLAT or BLAST (to generate...

alan.cs.gsu.edu - caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one...

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

www.homolog.us - If genomes were completely random sequences in a statistical sense, 'overlap-consensus-layout' method would have been enough to assemble large genomes from Sanger reads. In contrast, real genomes often have long repetitive regions, and they are hard...