BOL

shendurelab.github.io - LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly. Further information about LACHESIS, including source code, documentation and a user's guide are available...

sourceforge.net - Contiguity preserving transposition and sequencing (CPT-seq) is an entirely in vitro means of generating libraries comprised of 9216 indexed pools, each of which contains thousands of sparsely sequenced long fragments ranging from 5 kilobases to...

github.com - odgi provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses. Careful encoding of graph entities allows odgi to efficiently...

ftp.ncbi.nih.gov - Now a days there are a lots of genomics databases available around the world. This bookmark is created to provide all links in one place ... ftp://ftp.ncbi.nih.gov/genomes/ https://hgdownload.soe.ucsc.edu/downloads.html

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

bioinfologics.github.io - What is a k-mer anyway? A k-mer is just a sequence of k characters in a string (or nucleotides in a DNA sequence). Now, it is important to remember that to get all k-mers from a sequence you need to get...

wiki.bits.vib.be - compare two BWA mapping methods with the online hg18-mapped data We first operate a rapid inspection of the different BAM files using samtools flagstat. Illumina provided chr21 read mapping obtained with their GA IIx deep...

Saved Cornell University assembly workshop PPT. Reference:  http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf

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.