• the Gene Ontology (GO), which provides the logical structure of the biological functions (‘terms’) and their relationships to one another, manifested as a directed acyclic graph
• the corpus of GO annotations, evidence-based statements relating a specific gene product (a protein, non-coding RNA, or macromolecular complex, which we often refer to as ‘genes’ for simplicity) to a specific ontology term

Together, the ontology and annotations aim to describe a comprehensive model of biological systems. Currently, the GO knowledgebase includes experimental findings from over 140 000 published papers, represented as over 600 000 experimentally-supported GO annotations. These provide the core dataset for additional inference of over 6 million functional annotations for a diverse set of organisms spanning the tree of life.

In addition to this core knowledgebase, GOC resources also include software to edit and perform logical reasoning over the ontologies, web access to the ontology and annotations, and analytical tools that use the GO knowledgebase to support biomedical research.

Address of the bookmark: http://www.geneontology.org/

No. ACTREC/Advt./ 72 /2013

WALK IN INTERVIEW

1. JRF*
Genome-wide RNAi screen with human pooled tyrosine kinase shRNA libraries in head and neck squamous call carcinoma (HNSCC) cell lines
DBT A/C No. 3071, Dr. Amit Dutt

2. JRF
IRB Project ACTREC Funds
Dr. Amit Dutt

3. RA
Defining the cancer genome of Head and Neck Squamous Cell Carcinoma (HNSCC) with SNP arrays and next generation sequencing technology
A/C No. 2895, Dr. Amit Dutt

Duration of the Project: One year from the date of appointment, or as and when project terminates.

Consolidated Salary: RA : Rs. 40,000/- p.m.
JRF* (DBT): Rs. 20,800/- p.m.
JRF: Rs. 16,000/- p.m.
Date & Time: 6th November, 2013, at 10.00 a.m.

Venue: Conference Room

Minimum Qualifications and Experience:

RA: The ideal applicant should have a PhD in a relevant field. He/she should have a strong computational biology background, with demonstrated experience in coding using Perl, Python, Java or C++. He/she should be familiar with working in unix enviromnent, devising computational algorithms for data analysis, statistical data analysis in R and matlab and database programming using MySQL. Hands on experience in analyzing high throughput data would be an added advantage.

JRF* (DBT project): M.Sc. in Life Sciences or M.Tech in Biotechnology with good academic record (Minimum of 60% aggregate). Valid UGC-CSIR/DBT/ICMR JRF qualification and laboratory experience in molecular biology. Previous experience in molecular biology and animal tissue culture with high throughput platforms and ability to work with a large team would be desirable.

JRF (ACTREC project): M.Sc. in Life Sciences or M.Tech in Biotechnology with good academic record (Minimum of 60% aggregate). Minimum 2 yrs experience in molecular biology and animal tissue culture with high throughput platforms and ability to work with a large team is essential.

*M.Sc. degree obtained after a one year course will not be considered.

Candidates fulfilling above requirements should send their application by e-mail to
‘careers.duttlab@gmail.com. in the format given below so as to reach on or before
4th November, 2013.

Advertisement:

http://www.actrec.gov.in/data%20files/2013/AD-RA-JR-TECHN-6-NOV.pdf

Address of the bookmark: https://github.com/dglemay/G-NEST

1. Project Junior Research Fellow / Project Assistant

Last Date: 11th Nov 2013

Qualification B.Tech (Comp. Sci.), B.Tech/M.Tech (Bioinformatics), MCA, M.Sc. (Mathematics/Statistics)

Desirable Qualifications: Programming in FORTRAN/ C /PERL, Web application technologies

Upper Age limit 28

Rs.12000 / Rs.16000 (as sanctioned by the funding agency)

General terms and conditions:

Positions are purely temporary and co-terminus with the project.

HRDG (CSIR) prevailing guidelines are applicable these positions.

All categories of applicants are required to submit online application.

Enhancement of stipend to Project JRF to Project SRF will be with the due recommendation of Principal Investigator and approval of the Director on the evaluation of the 3 member Standing Committee consisting of Chairperson at the level of Chief Scientist, Coordinator of the JRFs/RAs/PDFs and the Principal Investigator of the Project.

The age relaxation as per HRDG (CSIR) norms: SC/ST/OBC/Women/Physically Handicapped persons – five years.

The Stipend normally be fixed at Rs.22000/- for Research Associates/Post Doc. Fellows. However, a selected RA/PDF may be placed in the higher start of stipend if there is ample justification and such recommendation is made by the Selection Committee. Based on the recommendation with justification by the PI and approval of the Director, person getting stipend at lower rate may be elevated to higher rate subject to availability of the funds in the project.

Recruitment will be based on initial screening based on qualifications and experience criteria and also based on suitability of the candidates to the nature of research project. This screening will be followed by written test followed / interview. After completing this process, candidates will be shortlisted and appointed in specific project subjects as and when appropriate positions become available. The pool of selected candidates will be valid for six months.

Remunerations indicate are maximum admissible and will depend upon the availability of funds and subject to conditions applicable to projects from different funding agencies at the time of recruitment.

Apply : http://www.ccmb.res.in/positions/projects/temp_positions.php

Form download : http://www.ccmb.res.in/positions/projects/oct-2013/pdf_download.php

Lab page: http://www.oeb.harvard.edu/faculty/edwards/index.html

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

Last Date for Submitting Application: 25th November 2013

1. Senior Scientist: (01 position)
Pay Scale: Rs.40, 000/-
Qualifications: PhD/ Post Doctoral with Experience in CADD

2. Junior Scientist (10 positions)
Pay Scale: Rs. 22,000/-
Qualifications: MPhil / Masters Degree in Bioinformatics / Computational Biology / CADD / Ayurveda

3. Technical Assistant (01+01 positions)
Pay Scale: Rs.12,000/-
Qualifications: 1. BSc Computer Science/ MCA
Qualifications: 2. MSc Biotechnology / MSc Microbiology

4. Programmer (01 position)
Pay Scale: Rs.20,000/-
Qualifications: MSc Computer Science/ MCA / B Tech (Experience in MATLAB, C, C++) Industrial experience is desirable

5. Teaching Assistant (03 positions)
Pay Scale: Rs.10,000/-
Qualifications: MSc in Bioinformatics

6. Administration Assistant (02 positions)
Pay Scale: Rs.8,000/-
Qualifications: Degree + PGDCA

The Selection process comprises of written test and interview. Positions are purely temporary (initially for the period of one year) and co-terminus with the project. For more details mail to: cbi.uok [at] gmail.com

More detail @ https://sites.google.com/site/centreforbioinformatics/announcements/applicationsinvitedforapplicationforai-caddproject

WALK-IN-INTERVIEW

The following vacancies shall be filled purely on adhoc basis under Non-Institutional adhoc project “Bioinformatics in ICMR Institutes” funded by Indian Council of Medical Research at Vector Control Research Centre, Puducherry, to be renewed annually and filled through Walk-in-Interview as indicated below. Candidates who wish to appear for the Walk-in-Interview can download the application format given in the website of Vector Control Research Centre (www.vcrc.res.in). Duly filled in application along with attested copies of certificate should be submitted at time of interview.

Date & Time : 05.12.2013 at 9.00 AM – Scientist-C (Non-Medical)

05.12.2013 at 1.30 PM – Scientist-B (Non-Medical)
06.12.2013 at 9.00 AM – Technical Assistant (Research Assistant)
06.12.2013 at 1.30 PM – Multi Tasking Staff (General)

Place : Vector Control Research Centre, Puducherry

Project entitled : Biomedical Informatics Centres of ICMR

1. Scientist - C (Non-Medical) Number of post – ONE

Essential qualification

B.E./ B. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University with 6 years experience in the relevant field OR

First class Master’s Degree and Ph.D. Degree in Bioinformatics/ Computational Biology from a recognized University OR

First class Master’s Degree in Bioinformatics/ Computational Biology from a recognized University with 4 years R & D experience in the related subjects as mentioned above OR

Second class Master’s Degree + Ph.D. in Bioinformatics/ Computational Biology from a recognized University with 4 years research experience in bio-medical subjects

Age: Not exceeding 40 years Consolidated Salary – Rs.39,960/- p.m. + HRA as
admissible

Desirable qualification (i) Post-doctorate in Bioinformatics/ Computational Biology or M.E. / M. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University for candidates with First Class relevant degree.

(ii) Additional post-doctoral research / teaching experience in Bioinformatics/Computational Biology in recognized Institute(s).

(iii) Knowledge of computer applications or data management

Job requirements i) To apply Bioinformatics / Computational Biology tools in understanding interactions between vectors and parasites/ pathogens and target based development of drug / insecticides.

ii) To assist the investigators to carry out genomic studies on parasites/pathogens/vectors of vector borne diseases

Advertisement: http://vcrc.res.in/Adv_Bio13.pdf

It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.

GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at http://lce.biohpc.swmed.edu/geneck

Address of the bookmark: http://lce.biohpc.swmed.edu/geneck/

The Law group provides internal Institute-specific development, training and support roles for data manipulation, sequence analysis and any other aspect of the analysis of biological data using computer systems. Additionally we provide databases and applications supporting the international animal science community, particularly tools and resources for genome mapping.

Head: Andy Law. Members: John Bowman (animal facility database applications), Zen Lu (bioinformatics support), Trevor Paterson (software development)

More @ http://www.bioinformatics.ed.ac.uk/groups/roslin-bioinformatics-group