BOL

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

github.com - HapCUT2 is a maximum-likelihood-based tool for assembling haplotypes from DNA sequence reads, designed to "just work" with excellent speed and accuracy. We found that previously described haplotype assembly methods are specialized for specific read...

atifrahman.github.io - SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing. Please email your questions, comments, suggestions, and bug reports to...

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

sepsis-omics.github.io - This is a tutorial for a workshop on long-read (PacBio) genome assembly. It demonstrates how to use long PacBio sequencing reads to assemble a bacterial genome, and includes additional steps for circularising, trimming, finding plasmids, and...

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