BOL

github.com - Automatic Filtering, Trimming, Error Removing and Quality Control for fastq dataAfterQC can simply go through all fastq files in a folder and then output three folders: good, bad and QC folders, which contains good...

github.com - Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the...

musket.sourceforge.net - Musket is a well-established leading next-generation sequencing read error correction algorithm targetting Illumina sequencing. This corrector employs the k-mer spectrum approach and introduces three correction techniques in a multistage...

ivory.idyll.org - DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to store k-mer graphs efficiently, discard redundant data, and count them efficiently. More recently, we've...

github.com - Miniasm is a great long-read assembly tool: straight-forward, effective and very fast. However, it does not include a polishing step, so its assemblies have a high error rate – they are essentially made of stitched-together pieces of long...

The scientists established some guidelines for determining whether a variant is a legitimate branch of an existing lineage:

github.com - Snippy finds SNPs between a haploid reference genome and your NGS sequence reads. It will find both substitutions (snps) and insertions/deletions (indels). It will use as many CPUs as you can give it on a single computer (tested to 64 cores). It is...

genome.sph.umich.edu - vt is a variant tool set that discovers short variants from Next Generation Sequencing data. https://genome.sph.umich.edu/wiki/Vt https://github.com/atks/vt

github.com - Structural variant comparison tool for VCFs Given benchmark and comparsion sets of SVs, calculate the recall, precision, and f-measure. Spiral Genetics Motivation

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