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

COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly

Jit — Wed, 06 Dec 2017 02:08:14 -0600

An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30× simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.

Address of the bookmark: ftp://ftp.genomics.org.cn/pub/cope

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

3d-dna: 3D de novo assembly (3D DNA) pipeline

Jit — Thu, 28 Dec 2017 10:09:37 -0600

This code is designed to enable anyone to reproduce the Hs2-HiC and the AaegL4 genomes reported in: Dudchenko et al., De novo assembly of the Aedes aegypti genome using Hi-C yields chromosome-length scaffolds. Science, 2017.

Unless otherwise noted, all terminology below is consistent with this paper, and all references to figures and tables in this readme refer to this paper. Specifically, some of the terminology used below is outlined in Figure S2. The assembly procedure is described in detail in the Supporting Online Materials, specifically in the section labelled “Pipeline description”.

In addition, the pipeline uses tools and methods from Juicer (Durand & Shamim et al., Cell Systems, 2016) and Juicebox (Durand & Robinson et al., Cell Systems, 2016), as well as additional dependencies noted below.

Feel free to post your questions and comments at: http://www.aidenlab.org/forum.html

http://aidenlab.org/documentation.html

Address of the bookmark: https://github.com/theaidenlab/3d-dna

ALPACA: A hybrid strategy for assembly of genomic DNA shotgun sequencing reads.

Seema Singh — Mon, 30 Apr 2018 04:38:40 -0500

ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.

Detail paper at https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8

Address of the bookmark: https://github.com/VicugnaPacos/ALPACA

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

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach

Rahul Nayak — Tue, 05 Jun 2018 09:57:11 -0500

PERGA - Paired End Reads Guided Assembler PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate. The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.

Address of the bookmark: https://github.com/hitbio/PERGA

ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly

Rahul Nayak — Tue, 03 Jul 2018 04:09:46 -0500

With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries. Texas A&M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory. Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice. Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.

Address of the bookmark: http://faculty.cse.tamu.edu/shsze/asplice/

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

QUAST-LG: Versatile genome assembly evaluation

Jit — Thu, 25 Oct 2018 10:46:55 -0500

QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we introduce a concept of upper bound assembly for a given genome and set of reads, and compute theoretical limits on assembly correctness and completeness. Using QUAST-LG, we show how close the assemblies are to the theoretical optimum, and how far this optimum is from the finished reference.

AVAILABILITY AND IMPLEMENTATION:

http://cab.spbu.ru/software/quast-lg

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