• Filters SNVs from any variant caller to remove false positives
• Calculates metrics based on BAM files and provides filtering not possible with other tools
• Fully user-configurable filtering (including which filters to use and their thresholds)
• Option to use filters identical to ICGC recommendations

FiNGS provides researchers with a tool to reproducibly filter somatic variants that is simple to both deploy and use, with filters and thresholds that are fully configurable by the user. It ingests and emits standard variant call format (VCF) files and will slot into existing sequencing pipelines. It allows users to develop and implement their own filtering strategies and simple sharing of these with others.

FiNGS reliably improves upon the precision of default variant caller outputs and performs better than other tools designed for the same task.

Address of the bookmark: https://github.com/cpwardell/FiNGS

Variant calling and/or genotyping

• DiscoSNP++ and discoSnpRAD: Reference-free small variant discovery (SNPs and indels)
• MindTheGap: Detection and assembly of large insertion variants
• TakeABreak: reference-free inversion discovery tool
• SVJedi: Structural Variant genotyper with long read data
• SVJedi-graph: Structural Variant genotyper with long read data using a variation graph

Sequence assembly

• MinYS: reference-guided genome assembly in metagenomics data
• MTG-link: local assembly tool for linked-read data
• Minia: De novo short read assembler
• de-novo pipeline: de-novo assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes
• Mapsembler2: Targeted assembly (not maintained)

Managing k-mers & indexation

• findere: simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
  • fimpera extends findere adding the abundance information.
• kmtricks: modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.
• kmindex is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.
• back to sequences: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.
• Backpack Quotient Filter: k-mer indexing data structure with abundance
• short read connector: Detect similar reads from potentially large read set
• DSK: Count K-mer in sequences

Pangenome graph manipulation

• Pancat: Pangenome Comparison and Analysis Toolkit
• GFAGraphs: a Python library to handle pangenome graph files in GFA format.

Comparative metagenomics with k-mers

• Simka and SimkaMin: Comparative metagenomics for large-scale datasets
• Comparead & Commet: comparison of metagenomic datasets

Species and bacterial strains identification

• ORI: software using long nanopore reads to identify bacteria present in a sample at the strain level
• StrainFLAIR: STRAIN-level proFiLing using vArIation gRaph

General-purpose sequencing data manipulation

• GASSST: long read mapper
• Leon: short read compressor (now included in GATB-core)
• Bloocoo: short read corrector
• BCALM: Construct compacted de Bruijn graphs (unitigs)

 Protein Structure

• A_Purva: Contact Map Overlap solver
• MD-Jeep: Distance Geometry solver
• CSA: Comparative Structural Alignment

Workflow

• SLICEE: parallel execution of bioinformatics workflows

Comparative Genomics

• CASSIS: detection of rearrangement breakpoints
• PLAST: intensive bank-to-bank sequence comparison
• DRJBreakpointFinder: detection and precise localization of excision sites in proviral segments

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

It demonstrates how to use long PacBio sequencing reads to assemble a bacterial genome, and includes additional steps for circularising, trimming, finding plasmids, and correcting the assembly with short-read Illumina data.

 Please comment if you know any other long read addembly tutorial.

Address of the bookmark: http://sepsis-omics.github.io/tutorials/modules/cmdline_assembly_v2/

Address of the bookmark: https://github.com/fenderglass/Flye

https://academic.oup.com/nar/article/47/11/e63/5377471

Address of the bookmark: https://github.com/linzhi2013/MitoZ

More at https://software.broadinstitute.org/gatk/download/bundle

ftp://ftp.ncbi.nlm.nih.gov/snp/organisms/human_9606/VCF/GATK/.

ftp://ftp.broadinstitute.org/bundle/hg38/hg38bundle/

Address of the bookmark: https://console.cloud.google.com/storage/browser/genomics-public-data/resources/broad/hg38/v0?pli=1

##################################################
[Mon May 7 11:29:18 2018] Reduction...
#file name genome size contigs heterozygous size [%] heterozygous contigs [%] identity [%] possible joins homozygous size [%] homozygous contigs [%]
/usr/lib/python2.7/dist-packages/matplotlib/font_manager.py:273: UserWarning: Matplotlib is building the font cache using fc-list. This may take a moment.
warnings.warn('Matplotlib is building the font cache using fc-list. This may take a moment.')
test/run1/contigs.fa 163897 245 66377 40.50 221 90.20 94.854 0 97520 59.50 24 9.80

##################################################
[Mon May 7 11:29:29 2018] Estimating parameters of libraries...
Aligning 19504 mates per library...
Insert size statistics Mates orientation stats
FastQ files read length median mean stdev FF FR RF RR
test/5000_1.fq.gz test/5000_2.fq.gz 50 4998 4990.20 721.47 0 4674 0 0
test/600_1.fq.gz test/600_2.fq.gz 100 599 598.63 47.68 0 10000 0 0

##################################################
[Mon May 7 11:29:29 2018] Scaffolding...
iteration 1.1: test/run1/contigs.reduced.fa 24 97520 39.355 17 94157 7321 2195 0 29603
19505 pairs. 17302 passed filtering [88.71%]. 1627 in different contigs [8.34%].
1526 pairs. 558 in different contigs [36.57%].
iteration 1.2: test/run1/_sspace.1.1.fa 3 97626 39.344 3 97626 87536 6063 821 87536
19505 pairs. 17607 passed filtering [90.27%]. 182 in different contigs [0.93%].
1077 pairs. 124 in different contigs [11.51%].
iteration 2.1: test/run1/_sspace.1.2.fa 3 97626 39.344 3 97626 87536 6063 821 87536
19505 pairs. 15112 passed filtering [77.48%]. 1295 in different contigs [6.64%].
3417 pairs. 396 in different contigs [11.59%].
iteration 2.2: test/run1/_sspace.2.1.fa 1 99133 39.344 1 99133 99133 99133 2328 99133
19505 pairs. 15152 passed filtering [77.68%]. 0 in different contigs [0.00%].
3398 pairs. 0 in different contigs [0.00%].

##################################################
[Mon May 7 11:29:34 2018] Gap closing...
iteration 1.1: test/run1/scaffolds.fa 1 99133 39.344 1 99133 99133 99133 2328 99133

##################################################
[Mon May 7 11:29:35 2018] Final reduction...
#file name genome size contigs heterozygous size [%] heterozygous contigs [%] identity [%] possible joins homozygous size [%] homozygous contigs [%]
[WARNING] Nothing reduced!
test/run1/scaffolds.filled.fa 99390 1 0 0.00 0 0.00 0.000 0 99390 100.00 1 100.00

##################################################
[Mon May 7 11:29:35 2018] Reporting statistics...
#fname contigs bases GC [%] contigs >1kb bases in contigs >1kb N50 N90 Ns longest
test/contigs.fa 245 163897 40.298 24 117391 3975 233 0 29603
test/run1/contigs.fa 245 163897 40.298 24 117391 3975 233 0 29603
test/run1/contigs.reduced.fa 24 97520 39.355 17 94157 7321 2195 0 29603
test/run1/_sspace.1.1.fa 3 97626 39.344 3 97626 87536 6063 821 87536
test/run1/_sspace.1.2.fa 3 97626 39.344 3 97626 87536 6063 821 87536
test/run1/_sspace.2.1.fa 1 99133 39.344 1 99133 99133 99133 2328 99133
test/run1/_sspace.2.2.fa 1 99133 39.344 1 99133 99133 99133 2328 99133
test/run1/scaffolds.fa 1 99133 39.344 1 99133 99133 99133 2328 99133
test/run1/_gapcloser.1.1.fa 1 99390 39.689 1 99390 99390 99390 2 99390
test/run1/scaffolds.filled.fa 1 99390 39.689 1 99390 99390 99390 2 99390
test/run1/scaffolds.reduced.fa 1 99390 39.689 1 99390 99390 99390 2 99390

##################################################
[Mon May 7 11:29:35 2018] Cleaning-up...
#Time elapsed: 0:00:17.376924

The easiest way to install Gooey is via pip

pip install Gooey 

Alternatively, you can install Gooey by cloning the project to your local directory

git clone https://github.com/chriskiehl/Gooey.git

run setup.py

python setup.py install

Address of the bookmark: https://github.com/chriskiehl/Gooey

https://github.com/tanghaibao/jcvi

More at https://github.com/tanghaibao/jcvi/wiki

Address of the bookmark: https://github.com/tanghaibao/jcvi