bitbucket.org - SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.
Reads are simulated from both strands of a provided or randomly generated reference sequence.
The reference...
www.bioconductor.org - The QuasR package (short for Quantify and annotate short reads in R) integrates the functionality of several R packages (such as IRanges (Lawrence et al. 2013) and Rsamtools) and external software (e.g. bowtie, through the Rbowtie package, and...
apps.bioconnector.virginia.edu - Coverage / Read Count Calculator
Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).
Instructions: set the read length/configuration and genome size, then select what you want to calculate.
Written by Stephen...
github.com - Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data.
Input
Jabba takes as input a concatenated de Bruijn graph and a set of sequences:
the de Bruijn graph...
kallisto
Transcript abundance quantification from RNA-seq data (uses pseudoalignment for rapid determination of read compatibility with targets)
Software (C++)
https://pachterlab.github.io/kallisto/
Sailfish
Estimation of isoform abundances...
github.com - Binaries of ngs-bits are available via Bioconda. Alternatively, ngs-bits can be built from sources:
Binaries for Linux/macOS
From sources for Linux/macOS
From sources for Windows
GATB Library. The Genome Analysis Toolbox with de-Bruijn graph. A large part of tools developed by the GenScale team are based on this library.These methods enable the analysis of data sets of any size on multi-core desktop...
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.