BOL: Related items

Ra assembler - a de novo DNA assembler for third generation sequencing data

biogeek — Wed, 27 Dec 2017 20:36:54 -0600

Integration of the Ra assembler - a de novo DNA assembler for third generation sequencing data developed on Faculty of Electrical Engineering and Computing (FER), Ruder Boskovic Institute (RBI) and Genome Institute of Singapore (GIS).

Ra is in development since 2014 in the form of several separate components that used to be run individually.
This project aims to ease the usage of Ra by integrating it into a complete de novo assembly tool.

Unlike other state-of-the-art assemblers, Ra does not have an error correction step. Instead, it relies on detecting overlaps using a very sensitive and specific overlapper ("graphmap -w owler", https://github.com/isovic/graphmap) and constructing and reducing an overlap graph (Ra layout, https://github.com/mariokostelac/ra).

Address of the bookmark: https://github.com/mariokostelac/ra-integrate/

AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references

Manisha Mishra — Tue, 17 Apr 2018 16:21:20 -0500

AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.

Using AlignGraph

AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]

Address of the bookmark: https://github.com/baoe/AlignGraph

Scientist at Advanced Centre for Treatment, Research and Education in Cancer - Navi Mumbai, Maharashtra

Tue, 30 Aug 2016 04:16:15 -0500

Scientist
Advanced Centre for Treatment, Research and Education in Cancer - Navi Mumbai, Maharashtra
Scientist (One position)
Project: Bioinformatics centre DBT- Sub-DIC at ACTREC
Funding agency: DBT Grant No.232

Duration of the Project: Six Months from the date of appointment can be extended further for six months
Essential Qualification and Experience: 1st Class Masters Degree in Bioinformatics or Life Sciences equivalent degree from a recognized University with 4 years R&D experience in Bioinformatics or relevant subjects from recognized institutes.
OR
Ph.D. degree in Bioinformatics or Life Sciences from recognized University.
M.Sc. degree obtained after a one year course will not be considered.
Experience: Research/teaching experience in Bioinformatics or relevant subjects form recognized Institute(s).

More at http://www.actrec.gov.in/data%20files/Vacancies/2016/AV-scin-stud-trainee-6-Sept-16.docx

SWALO: Scaffolding with assembly likelihood optimization

Jit — Wed, 20 Jun 2018 02:45:16 -0500

SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing. Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.

Address of the bookmark: https://atifrahman.github.io/SWALO/

Converting a VCF into a FASTA given some reference !

Jit — Fri, 20 Jul 2018 10:03:53 -0500

Samtools/BCFtools (Heng Li) provides a Perl script vcfutils.pl which does this, the function vcf2fq (lines 469-528)

This script has been modified by others to convert InDels as well, e.g. this by David Eccles

./vcf2fq.pl -f <input.fasta> <all-site.vcf> > <output.fastq>

https://github.com/gringer/bioinfscripts/blob/master/vcf2fq.pl

https://github.com/lh3/samtools/blob/master/bcftools/vcfutils.pl

SKESA: strategic k-mer extension for scrupulous assemblies

Jit — Wed, 14 Nov 2018 04:45:41 -0600

SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit shows that SKESA produces assemblies that have high sequence quality and contiguity, handles low-level contamination in reads, is fast, and produces an identical assembly for the same input when assembled multiple times with the same or different compute resources.

Source code for SKESA is freely available at https://github.com/ncbi/SKESA/releases.

Research Paper @ Link

SKESA algorithm are as follows:

Address of the bookmark: https://github.com/ncbi/SKESA/releases

SRF Bioinformatics at Bose Institute, India

Thu, 29 Sep 2016 09:39:13 -0500

Advt. No. S/DPB(CB)/17/2016-17
Junior Research Assistant/ Senior Research Assistant Job vacancies in Bose Institute on temporary basis
Project Title : “Genome wide transcriptome analysis to identity MYMIV-stress related genomic resources of blackgram”
Junior Research Assistant
Qualification : Good academic record in B.Sc. and M.Sc. in Botany or Biotechnology from reputed Universities. Must have good practical hand, this should be certified by two Senior/reputed PG teachers on a scale of 10.
Desirable : Preference will be given to those who already have some research experience (for at least 2 months).
Consolidated Pay : Rs. 16,400/- p.m.
Age Limit : Below 28 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).
Senior Research Assistant
Qualification : B.Sc. in Biotechnology and M.Sc. in Biotechnology or Bioinformatics. Hands on training in Bioinformatics. At least two Research Publications with Bioinformatics components.
Desirable : Preference will be given to the candidates who have previous experience in Next Gen Sequencing data analysis of genomic/transcriptome/miRNA.
Consolidated Pay : Rs. 18,700/- p.m.
Age Limit : Below 30 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).

http://www.boseinst.ernet.in/advertisement.html

Versatile genome assembly evaluation with QUAST-LG

Jit — Fri, 21 Dec 2018 22:06:31 -0600

QUAST-LG is an extension of QUAST intended for evaluating large-scale genome assemblies (up to mammalian-size).

QUAST-LG is included in the QUAST package starting from version 5.0.0 (download the latest release). Run QUAST as usual and do not forget to add ‐‐large option to your command!

A short list of the new features (see CHANGES for all):

Significant speedup achieved by both use of new fast aligner (minimap2) and the refactoring of alignment analyzing modules
New k-mer-based completeness and correctness metrics
BUSCO added for enhanced reference-free analysis
The concept of upper bound assembly (theoretical limits on the assembly completeness and contiguity for a given genome and set of reads)

Address of the bookmark: http://cab.spbu.ru/software/quast-lg/

Murasaki

Anjana — Fri, 30 Sep 2016 10:22:30 -0500

Murasaki is an anchor alignment program that is

exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))
scalable (Arbitrarily parallelizable across multiple nodes using MPI)
memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)
unlimited by pattern length or selection
repeat tolerant

Address of the bookmark: http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki

List of tools frequently used while genome assembly

BioStar — Tue, 22 Jan 2019 09:39:02 -0600

List of tools frequently used while genome assembly:

I have used the following assemblers

Spades (v. 3.10.1)
CANU (v. 1.6)
Unicycler (v. v0.4.1)
Miniasm (v. 0.2-r137-dirty)

I have used the following mappers

minimap2 (v. 2.0rc1-r232)
minimap (v. 0.2-r124-dirty)
bwa (v. 0.7.12-r1039)

I have used the following polishing tools

Racon (v. not available)
Pilon (v. 1.18)
Nanopolish (v. 0.8.3)

I have used the following tools to assess genome assembly characteristics

ANI.pl (https://github.com/chjp/ANI)
CheckM (v. 1.0.7)
Prokka (v. 1.12)
QUAST (v. 2.3)
mummer (v. not available)

If you have any ideas or superior tools we have missed please let us know in the comments.