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 Turner, based on the Lander-Waterman formula, inspired by a similar calculator written by James Hadfield. Coverage is calculated as C=LN/G and reads as N=CG/L where C = Coverage (X),L = Read length (bp), G = Haploid genome size (bp), and N = Number of reads. Source code on GitHub.

Address of the bookmark: http://apps.bioconnector.virginia.edu/covcalc/

Title: Comparison of Short Read De Novo Alignment Algorithms 

Author: Nikhil Gopal

Address of the bookmark: http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf

Detail paper at https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8

Address of the bookmark: https://github.com/VicugnaPacos/ALPACA

• Inchworm assembles the RNA-seq data into the unique sequences of transcripts, often generating full-length transcripts for a dominant isoform, but then reports just the unique portions of alternatively spliced transcripts.

• Chrysalis clusters the Inchworm contigs into clusters and constructs complete de Bruijn graphs for each cluster. Each cluster represents the full transcriptonal complexity for a given gene (or sets of genes that share sequences in common). Chrysalis then partitions the full read set among these disjoint graphs.

• Butterfly then processes the individual graphs in parallel, tracing the paths that reads and pairs of reads take within the graph, ultimately reporting full-length transcripts for alternatively spliced isoforms, and teasing apart transcripts that corresponds to paralogous genes.

More at https://github.com/trinityrnaseq/trinityrnaseq/wiki

......................................................................................................................................

Download Trinity here.

Build Trinity by typing 'make' in the base installation directory.

Assemble RNA-Seq data like so:

 Trinity --seqType fq --left reads_1.fq --right reads_2.fq --CPU 6 --max_memory 20G 

Find assembled transcripts as: 'trinity_out_dir/Trinity.fasta'

Address of the bookmark: https://github.com/trinityrnaseq/trinityrnaseq/wiki

http://www.ncbi.nlm.nih.gov/pubmed/23307812

http://bioen-compbio.bioen.illinois.edu/RACA/

Address of the bookmark: http://bioen-compbio.bioen.illinois.edu/RACA/

DISCOVAR can call variants on a region by region basis, potentially tiling an entire large genome. DISCOVAR variant calling is under active development and transitioning to VCF.

DISCOVAR de novo can generate de novo assemblies for both large and small genomes. It currently does not call variants.

More at https://www.broadinstitute.org/software/discovar/blog/?page_id=14

Address of the bookmark: https://www.broadinstitute.org/software/discovar/blog/

Canu is a hierachical assembly pipeline which runs in four steps:

• Detect overlaps in high-noise sequences using MHAP
• Generate corrected sequence consensus
• Trim corrected sequences
• Assemble trimmed corrected sequences

Read the documentation

New release https://github.com/marbl/canu/releases

Address of the bookmark: https://github.com/marbl/canu

Blaxter Lab, Institute of Evolutionary Biology, University of Edinburgh

Goal: To create blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step.

This repository accompanies the paper:
Blobology: exploring raw genome data for contaminants, symbionts and parasites using taxon-annotated GC-coverage plots. Sujai Kumar, Martin Jones, Georgios Koutsovoulos, Michael Clarke, Mark Blaxter
(submitted 2013-10-01 to Frontiers in Bioinformatics and Computational Biology special issue : Quality assessment and control of high-throughput sequencing data).

It contains bash/perl/R scripts for running the analysis presented in the paper to create a preliminary assembly, and to create and collate GC content, read coverage and taxon annotation for the preliminary assembly, which can be visualised, such as Figure 2a from the paper showing TAGC plots/blobplots for Caenorhabditis sp. 5: 

Address of the bookmark: https://github.com/blaxterlab/blobology

The pipeline consists of three steps/modules:

• redundancy reduction: detection and selectively removal of redundant contigs from an initial de novo assembly
• scaffolding: joining of genome fragments using paired-end and/or mate-pairs reads
• gap closing

Redundans is:

• fast & lightweight, multi-core support and memory-optimised, so it can be run even on the laptop for small-to-medium size genomes
• flexible toward many sequencing technologies (Illumina, 454 or Sanger) and library types (paired-end, mate pairs, fosmids)
• modular: every step can be ommited or replaced by another tools

Address of the bookmark: https://github.com/Gabaldonlab/redundans

Upcoming Deadlines
Regular Paper Submission: July 31, 2017
Regular Paper Authors Notification: October 16, 2017
Regular Paper Camera Ready and Registration: October 30, 2017

The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems, algorithmic concepts and information technologies to address challenging problems in Biomedical research with a particular focus on the emerging problems in Bioinformatics and computational biology. There is a tremendous need to explore how mathematical, statistical and computational models can be used to better understand biological processes and systems, while developing new methodologies and tools to analysis the massive currently-available biological data. Areas of interest to this community include systems biology, sequence analysis, biostatistics, image analysis, network and graph models, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and proteomics, and related areas.