DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on Nucleus, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the TensorFlow machine learning framework.

https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html

https://www.biorxiv.org/content/10.1101/092890v6

Address of the bookmark: https://github.com/google/deepvariant

Research Assistant Bioinformatics recruitment in National Institute Of Cancer Prevention & Research (ICMR) on Contract basis
Project entitled: “Next generation EGFR inhibitor identification using ligand based QSAR technique”

Essential: M.Sc. in Bioinformatics or related field. Desirable: Experience in QSAR and structure based drug designing.
Age: 28 years
No.of Post: 1

Pay Scale : Rs.27000

Application format is attached and should be sent by post to Dr. Subhash M Agarwal, Scientist D, Division of Bioinformatics, National Institute of Cancer Prevention & Research (ICMR), Plot No. I-7, Sector-39, Noida 201301 (U.P).

More at http://www.icmr.nic.in/icmrnews/NICPR_Advertisement%20for%20RA.pdf

Juicebox can now be used to visualize and interactively (re)assemble genomes. Check out the Juicebox Assembly Tools Module website https://aidenlab.org/assembly for more details on how to use Juicebox for assembly.

GUI at https://aidenlab.org/juicebox/

Address of the bookmark: https://github.com/aidenlab/Juicebox

https://academic.oup.com/bioinformatics/article/35/12/2153/5162749

Address of the bookmark: https://github.com/arzwa/wgd

Address of the bookmark: https://readthedocs.org/projects/bipype/

This also includes:

• A2Amapper: ATAC, Assembly to Assembly Comparision tool:
  • Comparative mapping between two genome assemblies (same species), or between two different genomes (cross species).

• Sim4db:
  • Spliced alignment of cDNA and genomic sequences, from the same (sim4) or related (sim4cc) species. Optimized for high-throughput batched alignment.

• LEAFF:
  • LEAFF (ahem, Let's Extract Anything From Fasta) is a utility program for working with multi-fasta files. In addition to providing random access to the base level, it includes several analysis functions.

• Meryl:
  • An out-of-core k-mer counter. The amount of sequence that can be processed for any size k depends only on the amount of free disk space.

Address of the bookmark: https://help.rc.ufl.edu/doc/Kmer

More at https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0611-3

Address of the bookmark: http://www.interactivenn.net/

Address of the bookmark: http://engr.case.edu/li_jing/papers/00798gpattern.pdf

Address of the bookmark: http://omega.omicsbio.org/

So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are PacBio E. coli sample, ERS473430, ERS544009, ERS554120, ERS605484, ERS617393, ERS646601, ERS659581, ERS670327, ERS685285, ERS743109 and a deprecated PacBio E. coli data set. ONT data are acquired from the Loman Lab.

For a C. elegans PacBio data set (only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the HGAP3produces a 104Mb assembly with N50 1.61Mb. This dotter plot gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.

Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that minimap can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as MHAP and DALIGNER. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.

Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)

We start with an all against all comparison:

minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz

Then we can assemble

miniasm -f reads.fq reads.paf.gz > reads.gfa

Convert GFA to FASTA:

awk '/^S/{print ">"$2"\n"$3}' reads.gfa | fold > reads.fa

And then count how many contigs:

grep ">" reads.fa | wc -l

# Download sample PacBio from the PBcR website
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz | tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
# Install minimap and miniasm (requiring gcc and zlib)
git clone https://github.com/lh3/minimap && (cd minimap && make)
git clone https://github.com/lh3/miniasm && (cd miniasm && make)
# Overlap
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz
# Layout
miniasm/miniasm -f reads.fq reads.paf.gz > reads.gfa

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