Ryan M Layer, Colby Chiang, Aaron R Quinlan, and Ira M Hall. 2014. "LUMPY: a Probabilistic Framework for Structural Variant Discovery." Genome Biology 15 (6): R84. doi:10.1186/gb-2014-15-6-r84.

More at https://github.com/arq5x/lumpy-sv

Address of the bookmark: https://github.com/arq5x/lumpy-sv

Look for KaKs calculation:

https://github.com/fumba/kaks-calculator

http://longlab.uchicago.edu/?q=gKaKs

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

Address of the bookmark: http://longlab.uchicago.edu/?q=gKaKs

http://www.e-rna.org/r-chie/plot.cgi?eg=single

Address of the bookmark: http://www.e-rna.org/r-chie/plot.cgi?eg=single

Reference: 

http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf

Address of the bookmark: https://github.com/lh3/fermi

Quickstart

http://nanopolish.readthedocs.io/en/latest/quickstart_consensus.html

Algorithms

http://simpsonlab.github.io/2017/06/30/nanopolish-v0.7.0/

Address of the bookmark: https://github.com/jts/nanopolish

Address of the bookmark: http://qb.cshl.edu/genomescope/

usage:   canu [-correct | -trim | -assemble | -trim-assemble] \
              [-s ] \
               -p  \
               -d  \
               genomeSize=[g|m|k] \
               -maxThreads=2 \
               useGrid=false \
              [other-options] \
               read_file.fastq.gz

A default Canu run produces usually high quality assembly, example of a command that was used for testing can be found below. However, there are still a lot of parameters that are possible to tweak. For example if we desire to assemble haplotypes separately of if we want to smash them together, we can alternate the error correction process.

canu -p test_asmbl \
     -d asm_test3 \
     genomeSize=2m \
     -maxThreads=2 useGrid=false \
     -pacbio-raw \ ~/pacbio/dna/sample_reads.fastq.gz

There is a brilliant section in documentation about parameter tweaking.

The output directory contains will contain many files. The most interesting ones are:

• *.correctedReads.fasta.gz : file containing the input sequences after correction, trim and split based on consensus evidence.
• *.trimmedReads.fastq : file containing the sequences after correction and final trimming
• *.layout : file containing informations about read inclusion in the final assembly
• *.gfa : file containing the assembly graph by Canu
• *.contigs.fasta : file containing everything that could be assembled and is part of the primary assembly

The basic stats of assembly can be read from reports generated by the assembler, or calculated using standard UNIX command line tools.

More at https://canu.readthedocs.io/en/latest/faq.html

Run Maq Now

Follow these steps to try Maq. All you need is a reference sequence file in the FASTA format.

1. Prepare a reference sequence (ref.fasta). Better a bacterial genome.
2. Download maq, maq-data and maqview at the download page.
3. Copy maq, maq.pl and maq_eval.pl to the $PATH or to the same directory.
4. Simulate diploid reference and read sequences, map reads, call variants and evaluate the results in one go:

   maq.pl demo ref.fasta calib-30.dat
   

   where calib-30.dat is contained in maq-data.
5. View the alignment:

   cd maqdemo/easyrun;
   maqindex -i -c consensus.cns all.map;
   maqview -c consensus.cns all.map

Even for advanced maq users, running `maq.pl demo' is recommended. You may find something helpful.

Address of the bookmark: http://maq.sourceforge.net

Careful encoding of graph entities allows odgi to efficiently compute and transform pangenomes with minimal overheads. odgi implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.

The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.

The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.

Address of the bookmark: https://github.com/pangenome/odgi