BOL: Related items

WALK-IN INTERVIEW @ JIPMER

Mon, 05 Sep 2016 04:01:13 -0500

Department of Preventive and Social Medicine
, JIPMER, Puducherry –605006

WALK-IN INTERVIEW

JIP/PSM/INDO-US TB/ 2016/

Walk-in-interview for the following vacant posts funded by Department of Biotechnology, Govt.of India for the project entitled “Biomarkers for Risk of Tuberculosis and for Tuberculosis Treatment Failure and Relapse” in the Department of Preventive & Social Medicine, JIPMER, Puducherry.

3. Technical Assistant

MCA/ MSc in Biostatistics/ MSc in Computational Biology from any recognized University @ Rs.23,220 1

Interested candidates may attend the walk-in interview with written screening test on 07, September 2016 at 9.30 A.M in the Dept. of Preventive and Social Medicine, IV Floor, Administrative Block, JIPMER.

The applicants are requested to bring the filled in application form and bio-data with original certificates for verification.

More Info: http://jipmer.edu.in/wp-content/uploads/2016/09/RECRUITEMENTsite-protocol-7.9.2016.pdf

miniasm: very fast OLC-based de novo assembler for noisy long reads

Jit — Mon, 27 Nov 2017 07:58:49 -0600

Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final unitig sequences. Thus the per-base error rate is similar to the raw input reads.

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

JRF Bioinformatics at MANIT, India

Thu, 18 Aug 2016 02:48:53 -0500

Advt. No.: Maths./577/2016 Date: 12/08/2016
JRF Bioinformatics Job Position in Maulana Azad National Institute of Technology (MANIT) purely temporary basis
Project Title : “Computational Approach to Study Complex Biological Network of Diseases using Molecular Data”
Essential Qualifications & experience: M.Tech in Bioinformatics/ Computational System biology/Computer Science or M.Sc. in Bio informatics/Biotechnology/Mathematics/Statistics from recognized University/ Institute. Preference will be given to GATE/NET qualified candidates.
No. of Post : 01
Fellowship: INR 12000

How to apply
The duly completed application on prescribed format along with copies of supporting documents must reach to: office of the Dr. Usha Chouhan, Principal Investigator, Department of Mathematics, Bioinformatics & Computer Applications, Maulana Azad National Institute of Technology, Bhopal-462003 on or before 31/08/2016. A soft copy of the application should also be sent to ycchouhan@gmail.com email address of Principal Investigator.

More at http://www.web.manit.ac.in/Year%202016/JRF/walk%20in.pdf

RGFA: powerful and convenient handling of assembly graphs

Rahul Nayak — Thu, 25 Jan 2018 05:47:53 -0600

RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.

https://github.com/ggonnella/rgfa

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/

Project Scientist at National Agri-Food Biotechnology Institute (NABI)

Thu, 25 Aug 2016 05:49:36 -0500

Advt. No. NABI/8(18)/2012-PME-3
Project Scientist recruitment in National Agri-Food Biotechnology Institute (NABI)
Project Title : “Transfer and Evaluation of Indian Banana with Pro-Vitamin A (PVA) Constructs”
Essential qualifications: Ph.D. thesis submitted/awarded in any branch of life/plant sciences. Desirable qualification: a) Excellent academic record with research experience in area relevant to plant metabolic engineering, molecular biology and bioinformatics supported with high quality publications. b) Knowledge and experience of Chromatography and Mass Spectrometry based technological analysis of samples. c) Knowledge and experience of in-silico analysis such as trascriptomics, proteomics and genomics. c) Relevant research publications in reputed international journals with high impact factors.
No. of Post : 01
Age: 35 years
Emoluments: Rs.40,000/- per month.
How to apply
Walk-In-Interview on 29/08/2016 at National Agri-Food Biotechnology Institute, C-127, Industrial Area, Phase VIII, S.A.S. Nagar, Mohali-160 071 Email: siddharth@nabi.res.in

More at http://www.nabi.res.in/Vacancies/NABI/ResearchFellowships/JRFSRFRA/2016/NABI8(18)2012-PME-3/Advt.pdf

MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads

Rahul Nayak — Fri, 11 May 2018 05:07:45 -0500

MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current PBcR-Mhap pipeline. MECAT performance were compared with PBcR-Mhap pipeline, FALCON and Canu(v1.3) in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the PBcR-Mhap pipeline and FALCON.

https://www.nature.com/articles/nmeth.4432

Address of the bookmark: https://github.com/xiaochuanle/MECAT

Cerulean: A hybrid assembly using high throughput short and long reads

Rahul Nayak — Tue, 05 Jun 2018 10:10:15 -0500

Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads. Cerulean v0.1 has been implemented with bacterial genomes in mind. The method is fully described in Deshpande, V., Fung, E. D., Pham, S., & Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933. http://arxiv.org/abs/1307.7933

Address of the bookmark: https://sourceforge.net/projects/ceruleanassembler/

ChopStitch: exon annotation and splice graph construction using transcriptome assembly and whole genome sequencing data

Rahul Nayak — Tue, 03 Jul 2018 04:14:52 -0500

ChopStitch is a new method for finding putative exons and constructing splice graphs using an assembled transcriptome and whole genome shotgun sequencing (WGSS) data. ChopStitch identifies exon-exon boundaries in de novo assembled RNA-seq data with the help of a Bloom filter that represents the k-mer spectrum of WGSS reads. The algorithm also detects base substitutions in transcript sequences corresponding to sequencing or assembly errors, haplotype variations, or putative RNA editing events. The primary output of our tool is a FASTA file containing putative exons. Further, exon edges are interrogated for alternative exon-exon boundaries to detect transcript isoforms, which are reported as splice graphs in dot output format.

Address of the bookmark: https://github.com/bcgsc/ChopStitch

Traineeship/Studentship conducts University of Delhi (Gargi College)

Mon, 05 Sep 2016 03:45:58 -0500

Traineeship/Studentship cunducts University of Delhi (Gargi College) on purely temporary for a period of six months.
Traineeship — 01 (one post)
Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics. Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development
Studentship- 01 (one post)
Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics
Salary: Rs.8000/- p.m.
How to apply
Interested candidates are required to appear for the walk in interview on 14th. September, 2016 at 9.30 AM in Principal's Office, Gargi College, Sirifort Road, N. Delhi-110049

More at http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&cntnt01articleid=12859&cntnt01returnid=83

LR_Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly

Rahul Nayak — Thu, 14 May 2020 15:09:52 -0500

LR_Gapcloser is a gap closing tool using long reads from studied species. The long reads could be downloaed from public read archive database (for instance, NCBI SRA database ) or be your own data. Then they are fragmented and aligned to scaffolds using BWA mem algorithm in BWA package. In the package, we provided a compiled bwa, so the user needn't to install bwa. LR_Gapcloser uses the alignments to find the bridging that cross the gap, and then fills the long read original sequence into the genomic gaps.

Address of the bookmark: https://github.com/CAFS-bioinformatics/LR_Gapcloser