BOL

1000 Genomes data tutorial at ASHG Structural variants presentation by Jan Korbel European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research...

github.com - Watch out: only a few files are counted in coverage statistics. Full documentation on Read the Docs. A set of tools for viral metagenomics. virmet is called with a command subcommand syntax: virmet fetch --viral n, for example,...

qb.cshl.edu - Summary: GenomeScope is an open-source web tool to rapidly estimate the overall characteristics of a genome, including genome size, heterozygosity rate, and repeat content from unprocessed short reads. These features are essential for studying...

maq.sourceforge.net - Maq stands for Mapping and Assembly with Quality It builds assembly by mapping short reads to reference sequences. Maq is a project hosted by SourceForge.net. The project page is available athttp://sourceforge.net/projects/maq/....

bioinformatics.oxfordjournals.org - Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a...

Structural variation caller tools using long reads

ibest.github.io - ARC is a pipeline which facilitates iterative, reference guided de novo assemblies with the intent of: Reducing time in analysis and increasing accuracy of results by only considering those reads which should assemble...

mrfast.sourceforge.net - mrFAST is a read mapper that is designed to map short reads to reference genome with a special emphasis on the discovery of structural variation and segmental duplications. mrFAST maps short reads with respect to user defined error threshold,...

When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the B fragilis assembly by Mick Watson’s group. Again, running spades.py will show you the...

In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.