BOL: Related items

Bioinformatics JRF/RA/SRF position at Institute of Cytology and Preventive Oncology (ICPO)

Wed, 19 Nov 2014 20:16:32 -0600

Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301

Candidates having the below mentioned qualifications may appear for walk in interview at ICPO on 2nd December 2014 between 10.00 AM and 12:00 PM under the below time bound projects under Dr. Subhash M. Agarwal, Scientist C. The post is purely temporary and co-terminus with the project.

Research Assistant (One)
25650/- consolidated
Discovery of EGFR secondary mutant inhibitors using structure based screening approach (ICMR)
Duration: 7 months

Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record.

Desirable: Experience in scripting and molecular docking.

Below 30 years

Junior Research Fellow (One)

16,000 + 30% HRA = Rs. 20800/-

Identification of novel inhibitors targeting EGFR using an integrated ligand and structure based approach (DBT)

Duration: 9 months

Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record. Candidates with CSIR-UGC / ICMR, NET qualification will be preferred

Desirable: Experience in scripting, QSAR and molecular docking.

Below 28 years

Interested eligible candidates may send their applications with Bio-data by email at (smagarwal@gmail.com) or by post addressed to Dr. Subhash M Agarwal, Scientist C, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301 so as to reach latest by 1st December, 2014. The candidates may appear for interview at ICPO along with 3 copies of CV, photo and relevant certificates of qualifications in original and reprints of publications at the time of interview. It should be noted that No TA/DA will be paid for the walk in Interview.

Advertisement: www.icpo.org.in/advt-walk-in-interview.docx

minialign: fast and accurate alignment tool for PacBio and Nanopore long reads

Jit — Thu, 24 May 2018 08:33:26 -0500

Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.

Address of the bookmark: https://github.com/ocxtal/minialign

Genome Origami

Jitendra Narayan — Fri, 12 Dec 2014 22:48:17 -0600

There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director’s Blog highlights new research illustrating how the human genome folds inside the cell’s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.

http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome

Researchers have been working to determine how cells regulate gene expression for nearly as long as we’ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.

More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php

Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4

P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads

Jit — Tue, 12 Jun 2018 08:14:41 -0500

P_RNA_scaffolder, a fast and accurate tool using paired-end RNA-sequencing reads to scaffold genomes. This tool aims to improve the completeness of both protein-coding and non-coding genes. After this tool was applied to scaffolding human contigs, the structures of both protein-coding genes and circular RNAs were almost completely recovered and equivalent to those in a complete genome, especially for long proteins and long circular RNAs.

Address of the bookmark: http://www.fishbrowser.org/software/P_RNA_scaffolder/

WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012

Fri, 12 Dec 2014 21:33:02 -0600

Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:

1 Dr. A.K.Mishra Coordinator & PI (BTISnet)

Traineeship (two) for one year

Rs. 5000/- (consolidated)

M.Sc. (Bioinformatics) with 60 % marks from a recognized University

20-12-2014 (10:00 AM -11:00 AM)

Studentship (four) for one year

Rs. 2500/- (consolidated)

Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University

20-12-2014 (11:00 AM- 1:00 PM)

The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.

Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf

FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads

Jit — Mon, 20 Aug 2018 04:08:50 -0500

Here is the command to run the tool:

python finisherSC.py destinedFolder mummerPath

If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.

python finisherSC.py -par 20 destinedFolder mummerPath

Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.

    perl -pe 's/>[^\$]*$/">Seg" . ++$n ."\n"/ge' raw_reads.fasta > newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/>[^\$]*$/">Seg" . ++$n ."\n"/ge' contigs.fasta > newContigs.fasta
    cp newContigs.fasta contigs.fasta

Address of the bookmark: https://github.com/kakitone/finishingTool

Google Genomics

Tenzin Paul — Thu, 18 Dec 2014 11:05:42 -0600

Explore genetic variation interactively. Compare entire cohorts in seconds with SQL-like queries. Compute transition/transversion ratios, genome-wide association, allelic frequency and more.
Process big genomic data easily. Run batch analyses like principal component analysis and Hardy-Weinberg equilibrium on as many samples as you like, in minutes or hours, with just a little code.
Use Google's infrastructure and big data expertise. Store one genome or a million using Google Genomics and take advantage of the same infrastructure that powers Search, Maps, YouTube, Gmail and Drive.
Support emerging global standards. Google Genomics is implementing the API defined by the Global Alliance for Genomics and Health for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.

Address of the bookmark: https://cloud.google.com/genomics/

LoRMA: A tool for correcting sequencing errors in long reads

Abhimanyu Singh — Thu, 06 Sep 2018 16:21:01 -0500

An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of k-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75×, the throughput of the new method is at least 20% higher.

conda install -c atgc-montpellier lorma

Address of the bookmark: https://gite.lirmm.fr/lorma/lorma-releases/wikis/home

Studentship at Nagaland University

Tue, 16 Dec 2014 01:35:00 -0600

Nagaland University
(A Central University Estd. By the Act of Parliament No. 35 of 1989)
Lumami 798 627, Nagaland
DBT Sponsored ‘Bioinformatics Infrastructure Facility’ Centre

Applications in plain paper are invited for the posts of (1) Traineeship (2 Nos.) and (2) Studentship – (2 Nos.) in the DBT funded-Bioinformatics Infrastructure Facility (BIF), Nagaland University, Lumami-798627, Nagaland. Details are given below. Interested candidates may submit the application along with self attested copies of certificates in support of the candidature to Prof. Chitta Ranjan Deb, Coordinator or Dr. L. N. Kakati, Deputy Coordinator, BIF Centre, Nagaland University, Lumami-798627, Nagaland on or before 15th January 2015.

The scanned application with relevant documents may be sent by email attachment to bifnulumami@gmail.com. Shortlisted candidates will be informed by email if called for interview. No TA/DA is admissible for attending the interview.

Traineeship (Two nos.)

Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Studentship (Two nos.)

Pursuing Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Terms and Conditions:

i) Applicants need to produce all original documents if call for interview.
ii) The posts are purely temporary and the appointment does not confer any entitlement or right over the job and will not be considered as formal service.
iii) No TA & DA will be paid for appearing in the walk-in-interview.
iv) The stipend/salary amount is subject to the sanction of DBT, New Delhi.

Advertisement: http://www.nagauniv.org.in/files/BIF%20Advt.pdf

Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads

Rahul Nayak — Fri, 19 Oct 2018 08:23:42 -0500

Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haplotypes in a top–down manner. And along a guided tree, it iteratively merges sibling leaves in a bottom–up manner if they are similar enough. Here, the similarity is defined by comparing the 2nd reads of a RAD segment. This approach tries to collapse heterozygote while discriminate repetitive sequences. At last, Rainbow uses a greedy algorithm to locally assemble merged reads into contigs. Rainbow not only outputs the optimal but also suboptimal assembly results. Based on simulation and a real guppy RAD-seq data, we show that Rainbow is more competent than the other tools in dealing with RAD-seq data

Address of the bookmark: https://sourceforge.net/projects/bio-rainbow/files/