http://biogps.org/#goto=welcome

Address of the bookmark: http://biogps.org/#goto=welcome

Address of the bookmark: http://www.ici.upmc.fr/cluego/

M.Sc. Bioinformatics Climate Change and Impacts Management
M.Sc. Biotechnology and Clinical Research

Department of Computer Science (Rollwala Computer Centre)
Appointment will be on purely contract basis for 11 months on consolidated salary. Reservation as per rules

How to apply
All the candidate are here by required to fill up the application form and given to concern Department, Gujarat University, Ahmedabad (Form can be submitted personally or thorough post/courier.) Candidates are supposed to attach the self attested photocopies of their required testimonials along with application form. Last date of receipt of application is 10/06/2016.

More http://www.gujaratuniversity.org.in/web/NWD/NewsEvents/1700_Recruitments%20at%20Gujarat%20University.asp

Blaxter Lab, Institute of Evolutionary Biology, University of Edinburgh

Goal: To create blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step.

This repository accompanies the paper:
Blobology: exploring raw genome data for contaminants, symbionts and parasites using taxon-annotated GC-coverage plots. Sujai Kumar, Martin Jones, Georgios Koutsovoulos, Michael Clarke, Mark Blaxter
(submitted 2013-10-01 to Frontiers in Bioinformatics and Computational Biology special issue : Quality assessment and control of high-throughput sequencing data).

It contains bash/perl/R scripts for running the analysis presented in the paper to create a preliminary assembly, and to create and collate GC content, read coverage and taxon annotation for the preliminary assembly, which can be visualised, such as Figure 2a from the paper showing TAGC plots/blobplots for Caenorhabditis sp. 5: 

Address of the bookmark: https://github.com/blaxterlab/blobology

Publication:

• L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.

Download:

• LoRMA 0.3 source files
• README

Address of the bookmark: https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/

Karnal -132001 (Haryana)

A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 05.09.2016 for the selection of Three Research Associate & One Young Professional - II as per details given below:

Name of the Scheme / Project: Center for Agricultural Bioinformatics. The post duration is Upto 31.032017 or earlier & Co-terminus with the project.

Research Associate (Three posts)

Date & Time of Interview: 10.30 A.M. on 05.09.2016

Essential Qualifications: PhD degree in any one of discipline/Subject Biotechnology/ Animal Genetics and Breeding/ Biochemistry/ Bioinformatics/Molecular Genetics OR Master’s degree in any one of above mentioned discipline/Subject with 4 years/5 years of Bachelor’s degree having 1st division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from Fellowship/Associateship

Desirable Qualifications: Experience in Database/Next Generation Sequencing Data analysis for 02 RA posts or working experience in molecular biology, gene expression data analysis, SNP genotyping and sequence data analysis, functional gene characterization for 01 RA post.

Young Professionals II One position

Date & Time of Interview: 10.30 A.M. on 05.09.2016

Essential: B. Tech or M.Tech. in Bioinformatics / Computer Science / Computer Application.

Desirable: Experience in Linux, MySQL, Java, C++/ PHP/ PERL R based data analysis and application development in Bioinformatics.

More Info : http://14.139.252.116/ADvertisementforCabinScheme.pdf

We developed a novel, self-contained technique named Near HGT, based on the synteny index, to measure the divergence of a gene from its native genomic environment and used it to identify candidate HGT events between closely related strains. The method confirms candidate transferred genes based on the constant relative mutability (CRM). Using CRM, the algorithm assigns a confidence score based on “unusual” sequence divergence. A gene exhibiting exceptional deviations according to both synteny and mutability criteria, is considered a validated HGT product. We first employed the technique to a set of three E. coli strains and detected several highly probable horizontally acquired genes. We then compared the method to existing HGT detection tools using a larger strain data set.

When combined with additional approaches our new algorithm provides richer picture and brings us closer to the goal of detecting all newly acquired genes in a particular strain.

Availability: The method is publicly available athttp://research.haifa.ac.il/~ssagi/software/nearHGT.zip

Address of the bookmark: http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004408

Wgsim is a small tool for simulating sequence reads from a reference genome. It is able to simulate diploid genomes with SNPs and insertion/deletion (INDEL) polymorphisms, and simulate reads with uniform substitution sequencing errors. It does not generate INDEL sequencing errors, but this can be partly compensated by simulating INDEL polymorphisms.

Wgsim outputs the simulated polymorphisms, and writes the true read coordinates as well as the number of polymorphisms and sequencing errors in read names. One can evaluate the accuracy of a mapper or a SNP caller with wgsim_eval.pl that comes with the package.

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

By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database nr used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.

Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.

Kaiju is described in Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. Nat. Commun. 7:11257 (open access).

Address of the bookmark: http://kaiju.binf.ku.dk/