BOL

bioinfo.konkuk.ac.kr - The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo...

github.com - tardis Toolkit for Automated and Rapid DIscovery of Structural variants Requirements zlib (http://www.zlib.net)mrfast (https://github.com/BilkentCompGen/mrfast)htslib (included as submodule; http://htslib.org/)Fetching tardis git clone...

github.com - NextSV, a meta SV caller and a computational pipeline to perform SV calling from low coverage long-read sequencing data. NextSV integrates three aligners and three SV callers and generates two integrated call sets (sensitive/stringent) for different...

github.com - This tool is used to merge structural variants (SVs) across samples. Each sample has a number of SV calls, consisting of position information (chromosome, start, end, length), type and strand information, and a number of other values. Jasmine...

github.com - Call sviper ~$ ./sviper -s short-reads.bam -l long-reads.bam -r ref.fa -c variants.vcf -o polished_variants This will output a polished_variants.vcf file, that contains all the refined variants. Sometimes it is helpful to look at the...

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

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