BOL

github.com - PERGA - Paired End Reads Guided Assembler PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct...

github.com - Unicycler is an assembly pipeline for bacterial genomes. It can assemble Illumina-only read sets where it functions as a SPAdes-optimiser. It can also assembly long-read-only sets (PacBio or Nanopore) where it runs...

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.

github.com - A de novo genome assembly can be summarised b y a number of metrics, including: Overall assembly length Number of scaffolds/contigs Length of longest scaffold/contig Scaffold/contig N50 and N90Assembly base composition, in...

converting a VCF file into a FASTA file given a reference sequence

github.com - SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit shows that SKESA produces assemblies that have high sequence quality and contiguity,...

cab.spbu.ru - QUAST-LG is an extension of QUAST intended for evaluating large-scale genome assemblies (up to mammalian-size). QUAST-LG is included in the QUAST  package starting from version 5.0.0 (download the latest release). Run QUAST as...

To decide which strategy should be our “preferred” genome assembly approach based on data rather than my gut-feeling about the “best assembly” I decided to do some testing with a known “true” reference E Coli K12 MG1655

www.nature.com - Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of...