BOL: Related items

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

vcfR

Archana Malhotra — Fri, 19 Aug 2016 07:38:24 -0500

Most variant calling pipelines result in files containing large quantities of variant information. The variant call format (vcf) is an increasingly popular format for this data. The format of these files and their content is discussed in the vignette ‘vcf data.’ These files are typically intended to be post-processed (i.e., filtered) as an attempt to remove false positives or otherwise problematic sites. The R package vcfR provides tools to facilitate this filtering as well as to visualize the effects of choices made during this process.

Address of the bookmark: https://cran.r-project.org/web/packages/vcfR/vignettes/visualization_1.html

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

Useful Bioinformatics Tools

Poonam Mahapatra — Mon, 29 Aug 2016 04:08:12 -0500

Collections of few handy tools for bioinformatician

http://molbiol-tools.ca/Convert.htm

Address of the bookmark: http://molbiol-tools.ca/Convert.htm

Artemis Comparison Tool (ACT)

Shruti Paniwala — Wed, 07 Sep 2016 03:54:41 -0500

ACT is a Java application for displaying pairwise comparisons between two or more DNA sequences. It can be used to identify and analyse regions of similarity and difference between genomes and to explore conservation of synteny, in the context of the entire sequences and their annotation. It can read complete EMBL, GENBANK and GFF entries or sequences in FASTA or raw format.

Address of the bookmark: http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act

CIRCOS Visualize !!

Jit — Fri, 02 Sep 2016 08:29:26 -0500

Before uploading a data file, check the samples gallery to make sure that your data format is compatible.

Your file must be plain text.
Your data values must be non-negative integers.
Data must be space-separated (one or more tab or space, which will be collapsed).
No two rows or columns may have the same name.
Column and row names must begin with a letter (e.g. 'A', 'A0', 'A-0') and can only contain letters, numbers and _. No punctuation!
Maximum row + column total is 150 — if exceeded, rows and columns are limited to 75.
If you are using order, size and color rows/columns in combination they must appear in that order.

Need help? Post questions to the Circos Google Group.

http://mkweb.bcgsc.ca/tableviewer/visualize/

Address of the bookmark: http://mkweb.bcgsc.ca/tableviewer/visualize/

Structural variants PPT

Jit — Wed, 07 Sep 2016 03:16:09 -0500

1000 Genomes data tutorial at ASHG

Structural variants presentation by

Jan Korbel

European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research Unit

Reference:

https://www.genome.gov/pages/research/der/1000genomesprojecttutorials/structuralvariants-jankorbel.pdf

FERMI

Jit — Fri, 09 Sep 2016 05:37:13 -0500

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of
unitigs to represent all the information in raw reads.

Fermi follows the overlap-layout-consensus paradigm and uses the FM-DNA-index (FMD-index) as the key data structure. It is inspired by the string graph assembler (Simpson and Durbin, 2010 and 2012) and has a similar workflow.

As a typical de novo assembler, fermi tends to produce contigs with slightly longer N50. However, the major weakness of fermi is the high misassembly rate. Although fermi provides a tool to fix misassemblies by using paired-end reads to achieve an accuracy comparable to other assemblers, this is not a favorable solution.

Fermi is designed to be used on a multi-core Linux machine with large shared memory. The easiest way to run fermi is to use the run-fermi.pl script. It generates a Makefile. The actual assembly is done by invoking make. Premature assembly processes can be resumed. Here is an example:

run-fermi.pl -dAPe ./fermi -p NA12878 -t16 -f18 reads*.fq.gz > NA12878.mak
make -f NA12878.mak -j16

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

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

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