All Projects β†’ jts β†’ Nanopolish

jts / Nanopolish

Licence: mit
Signal-level algorithms for MinION data

Projects that are alternatives of or similar to Nanopolish

Ngless
NGLess: NGS with less work
Stars: ✭ 115 (-68.66%)
Mutual labels:  bioinformatics, science
Abyss
πŸ”¬ Assemble large genomes using short reads
Stars: ✭ 219 (-40.33%)
Mutual labels:  bioinformatics, science
Rnaseq Workflow
A repository for setting up a RNAseq workflow
Stars: ✭ 170 (-53.68%)
Mutual labels:  bioinformatics, science
Arcs
🌈Scaffold genome sequence assemblies using linked read sequencing data
Stars: ✭ 67 (-81.74%)
Mutual labels:  bioinformatics, science
Jvarkit
Java utilities for Bioinformatics
Stars: ✭ 313 (-14.71%)
Mutual labels:  bioinformatics, science
Genomics
A collection of scripts and notes related to genomics and bioinformatics
Stars: ✭ 101 (-72.48%)
Mutual labels:  bioinformatics, science
Deepvariant
DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.
Stars: ✭ 2,404 (+555.04%)
Mutual labels:  bioinformatics, science
Awesome Biology
Curated (meta)list of resources for Biology.
Stars: ✭ 174 (-52.59%)
Mutual labels:  bioinformatics, science
catch
A package for designing compact and comprehensive capture probe sets.
Stars: ✭ 55 (-85.01%)
Mutual labels:  science, bioinformatics
sirius
SIRIUS is a software for discovering a landscape of de-novo identification of metabolites using tandem mass spectrometry. This repository contains the code of the SIRIUS Software (GUI and CLI)
Stars: ✭ 32 (-91.28%)
Mutual labels:  science, bioinformatics
Gatk
Official code repository for GATK versions 4 and up
Stars: ✭ 1,002 (+173.02%)
Mutual labels:  bioinformatics, science
Anvio
An analysis and visualization platform for 'omics data
Stars: ✭ 273 (-25.61%)
Mutual labels:  bioinformatics, science
Splatter Paper
Data and analysis for the Splatter paper
Stars: ✭ 17 (-95.37%)
Mutual labels:  bioinformatics, science
Ugene
UGENE is free open-source cross-platform bioinformatics software
Stars: ✭ 112 (-69.48%)
Mutual labels:  bioinformatics, science
Galaxy
Data intensive science for everyone.
Stars: ✭ 812 (+121.25%)
Mutual labels:  bioinformatics, science
Homebrew Bio
πŸΊπŸ”¬ Bioinformatics formulae for the Homebrew package manager (macOS and Linux)
Stars: ✭ 237 (-35.42%)
Mutual labels:  bioinformatics, science
qmflows
This library tackles the construction and efficient execution of computational chemistry workflows
Stars: ✭ 35 (-90.46%)
Mutual labels:  science, bioinformatics
Plantcv
Plant image analysis using OpenCV
Stars: ✭ 352 (-4.09%)
Mutual labels:  bioinformatics, science
Pyfaidx
Efficient pythonic random access to fasta subsequences
Stars: ✭ 307 (-16.35%)
Mutual labels:  bioinformatics
Awesome Sentinel
curated list of awesome tools, tutorials and APIs for Copernicus Sentinel satellite data
Stars: ✭ 335 (-8.72%)
Mutual labels:  science

Nanopolish

Build Status

Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome and more (see Nanopolish modules, below).

Release notes

  • 0.13.2: fix memory leak when loading signal data

  • 0.13.1: fix nanopolish index performance issue for some barcoding runs

  • 0.13.0: modify HMM transitions to allow the balance between insertions and deletions to be changed depending on mode (consensus vs reference variants)

  • 0.12.5: make SupportFractionByStrand calculation consistent with SupportFraction

  • 0.12.4: add SupportFractionByStrand and SOR to VCF

  • 0.12.3: fix hdf5 file handle leak

  • 0.12.2: add RefContext info to VCF output of nanopolish variants

  • 0.12.1: improve how nanopolish index handles summary files, add support for selecting reads by BAM read group tags (for nanopolish variants)

  • 0.12.0: live methylation calling, methylation LLR threshold changes as described here

  • 0.11.1: nanopolish polya now supports SQK-RNA-002 kits with automatic backwards-compatibility with SQK-RNA-001

  • 0.11.0: support for multi-fast5 files. nanopolish methyltrain now subsamples input data, improving speed and memory usage

  • 0.10.2: added new program nanopolish polya to estimate the length of poly-A tails on direct RNA reads (by @paultsw)

  • 0.10.1: nanopolish variants --consensus now only outputs a VCF file instead of a fasta sequence. The VCF file describes the changes that need to be made to turn the draft sequence into the polished assembly. A new program, nanopolish vcf2fasta, is provided to generate the polished genome (this replaces nanopolish_merge.py, see usage instructions below). This change is to avoid issues when merging segments that end on repeat boundaries (reported by Michael Wykes and Chris Wright).

Dependencies

A compiler that supports C++11 is needed to build nanopolish. Development of the code is performed using gcc-4.8.

By default, nanopolish will download and compile all of its required dependencies. Some users however may want to use system-wide versions of the libraries. To turn off the automatic installation of dependencies set HDF5=noinstall, EIGEN=noinstall, HTS=noinstall or MINIMAP2=noinstall parameters when running make as appropriate. The current versions and compile options for the dependencies are:

In order to use the additional python3 scripts within /scripts, install the dependencies via

pip install -r scripts/requirements.txt --user

Installation instructions

Installing the latest code from github (recommended)

You can download and compile the latest code from github as follows:

git clone --recursive https://github.com/jts/nanopolish.git
cd nanopolish
make

Installing a particular release

When major features have been added or bugs fixed, we will tag and release a new version of nanopolish. If you wish to use a particular version, you can checkout the tagged version before compiling:

git clone --recursive https://github.com/jts/nanopolish.git
cd nanopolish
git checkout v0.9.2
make

Nanopolish modules

The main subprograms of nanopolish are:

nanopolish call-methylation: predict genomic bases that may be methylated
nanopolish variants: detect SNPs and indels with respect to a reference genome
nanopolish variants --consensus: calculate an improved consensus sequence for a draft genome assembly
nanopolish eventalign: align signal-level events to k-mers of a reference genome

Analysis workflow examples

Data preprocessing

Nanopolish needs access to the signal-level data measured by the nanopore sequencer. The first step of any nanopolish workflow is to prepare the input data by telling nanopolish where to find the signal files. If you ran Albacore 2.0 on your data you should run nanopolish index on your input reads (-d can be specified more than once if using multiple runs):

# Index the output of the albacore basecaller
nanopolish index -d /path/to/raw_fast5s/ -s sequencing_summary.txt albacore_output.fastq

The -s option tells nanopolish to read the sequencing_summary.txt file from Albacore to speed up indexing. Without this option nanopolish index is extremely slow as it needs to read every fast5 file individually. If you basecalled your run in parallel, so you have multiple sequencing_summary.txt files, you can use the -f option to pass in a file containing the paths to the sequencing summary files (one per line).

Computing a new consensus sequence for a draft assembly

The original purpose of nanopolish was to compute an improved consensus sequence for a draft genome assembly produced by a long-read assembly like canu. This section describes how to do this, starting with your draft assembly which should have megabase-sized contigs. We've also posted a tutorial including example data here.

# Index the draft genome
bwa index draft.fa

# Align the basecalled reads to the draft sequence
bwa mem -x ont2d -t 8 draft.fa reads.fa | samtools sort -o reads.sorted.bam -T reads.tmp -
samtools index reads.sorted.bam

Now, we use nanopolish to compute the consensus sequence (the genome is polished in 50kb blocks and there will be one output file per block). We'll run this in parallel:

python3 nanopolish_makerange.py draft.fa | parallel --results nanopolish.results -P 8 \
    nanopolish variants --consensus -o polished.{1}.vcf -w {1} -r reads.fa -b reads.sorted.bam -g draft.fa -t 4 --min-candidate-frequency 0.1

This command will run the consensus algorithm on eight 50kbp segments of the genome at a time, using 4 threads each. Change the -P and --threads options as appropriate for the machines you have available.

After all polishing jobs are complete, you can merge the individual 50kb segments together back into the final assembly:

nanopolish vcf2fasta -g draft.fa polished.*.vcf > polished_genome.fa

Calling Methylation

nanopolish can use the signal-level information measured by the sequencer to detect 5-mC as described here. We've posted a tutorial on how to call methylation here.

To run using docker

First build the image from the dockerfile:

docker build .

Note the uuid given upon successful build. Then you can run nanopolish from the image:

docker run -v /path/to/local/data/data/:/data/ -it :image_id  ./nanopolish eventalign -r /data/reads.fa -b /data/alignments.sorted.bam -g /data/ref.fa

Credits and Thanks

The fast table-driven logsum implementation was provided by Sean Eddy as public domain code. This code was originally part of hmmer3. Nanopolish also includes code from Oxford Nanopore's scrappie basecaller. This code is licensed under the MPL.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].