No. of Posts and Specialization: 1(UR)

Educational Qualification:

(i) Good academic record with a Ph.D. Degree in the concerned /allied /relevant disciplines.

(ii) The Ph.D. Degree shall be a mandatory qualification for all candidates to be appointed as Associate Professor through direct recruitment.

(iii) A Master‟s Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).

(iv) A minimum of eight years of experience of teaching and /or research in an academic /research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/Industry excluding the period of Ph.D research with evidence of published work and a minimum of 5 publications as books and /or research papers in refereed journals only/policy papers.

(v) Contribution to educations innovation, design of new curricula and courses and technology-mediated teaching learning process with evidence of having guided doctoral candidates and research students.

(vi) A minimum score as stipulated in the Academic Performance Indicator (API) based performance Based Appraisal System (PBAS), set out in this notification in as mentioned in the advertisement.

Send your application to the A.R (Estt.Teaching), M.D.University, Rohtak on or before December 23, 2013.

For more details: http://www.mdurohtak.ac.in/pdf/Notices_Pdf/new_notice/Teaching%20Vacancy%20%28ADVT.%20No.%20PR-54%20of%202013%29.pdf

Last Apply Date: 23 Dec 2013

NOTIFICATION FOR FACULTY RECRUITMENT – 2013

(Faculty openings in Technology, Science, Architecture and Management at NIT Calicut, Kerala)

National Institute of Technology Calicut, Kerala, established under Act XXIX/ 2007of the Parliament is one of the leading technological institutions in the Country with nearly 6000 students enrolled for various UG, PG and Ph.D. programmes in Technology, Science, Architecture and Management. The Institute invites applications from Indian nationals, possessing consistent excellent academic record, commitment to quality teaching and potential for carrying out outstanding research, for the post of Assistant Professors in various departments against the backlog reserved vacancies for Scheduled Caste (SC), Scheduled Tribe (ST), Other Backward Communities (OBC) and Persons with Disabilities (PWDs) and also under open merit quota as detailed below. Candidates belonging to SC, ST and OBC desirous of considering for selection under UR category also shall specifically indicate so in column 4.

Reservation quota for PWDs will be counted against the respective community. Young, meritorious, dynamic and student friendly academicians are welcome to join hands with the existing team in their effort to transform this Institute to a world class educational institution.

Candidates possessing Ph.D. degree will be considered for appointment on contract basis initially.

They will be considered for movement to AGP `7000 after one year of satisfactory performance.

Meritorious candidates possessing M.Tech./M.Phil. (*) with remarkably good potential to carry out outstanding research and already pursuing Ph.D. or aspiring to pursue Ph.D. will also be considered for appointment on contract, initially for a period of 3 years, extendable for a further period of 2 years on a year to year basis or till the candidate acquires Ph.D. degree whichever is earlier. Renewal of contract
will be done on an annual basis, subject to satisfactory progress of Ph.D. work, good conduct and good performance in teaching. Faculty appointed on contract basis will not be treated as regular staff till they are regularized, subject to the conditions stated earlier. The Institute has adopted 4-tier flexible faculty structure recommended by MHRD.

More Info : http://www.nitc.ac.in/index.php/?url=content/submenu/2345/5

    // | |     //   ) )  //   ) ) //   ) )  // | |
   //__| |    //        //   / / //___/ /  //__| |
  / ___  |   //  ____  //   / / / ___ (   / ___  |
 //    | |  //    / / //   / / //   | |  //    | |
//     | | ((____/ / ((___/ / //    | | //     | |

AGORA is used to generate ancestral genomes for the Genomicus online server for gene order comparison, and has been in constant use in the group since.

Address of the bookmark: https://github.com/DyogenIBENS/Agora

NAME OF THE POST : SRF/JRF (Four Posts only)

DURATION : Indicated with the respective project mentioned below:

NAME OF THE PROJECT : As Mentioned below:

1. Serological diversity and molecular characterization of Dichelobector nodusus and development of vaccine against virulent footroot funded by NAIP. (Tenable upto 31.03.2014)

2. Development of oral vaccine against Clostridium perfringenes employing translational fusion of immunodominant epitopes of beta toxin with heat labile entertoxin B funded by DBT. (Tenable upto 25.02.2014)

3. Indo-Norwegian project, “Evaluation of major porins, ompC and ompR of Areomonas hydrophila as potential vaccine candidates and identification and characterization of immune genes of Indian major carp, Labeo rohita” (Tenable upto 31.03.2014)

EDUCATIONAL QUALIFICATIONS: For JRF- M.Sc/M.Tech in any subject of Biological Sciences/Life Sciences

For SRF- M.Sc/M.Tech in any subject of Biological Sciences/Life Sciences with 2 years of Research Experience.

JOB DESCRIPTION : The Candidate should have experience in gene Expression, protein purification, molecular biology techniques and bioinformatics
EMOLUMENTS : SRF: Rs. 18,000/- per month consolidated plus 30% HRA if /NET/GATE qualified otherwise Rs. 14,000/- per month consolidated + 30% HRA.

JRF: Rs. 16,000/- per month consolidated + 30% HRA if NET/GATE qualified otherwise Rs. 12,000/- per month consolidated + 30% HRA

SCIENTIST NAME : Dr. Lalit C. Garg, SS-VII (Gene Regulation Lab)

SCIENTIST’S EMAIL : lalit@nii.ac.in

WALK IN INTERVIEW ON : October 31st, 2013

REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM

Advertisement: http://www1.nii.res.in/sites/default/files/project-Dr.Lalit-31oct2013.pdf

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

More at http://incob2014.org/

Address of the bookmark: https://sourceforge.net/projects/glean-gene/

There are several jobs opening in bioinformatics all around the world, but many of them do not get proper attention due to lack of advertisements, or social connectivity. This bookmark is created for an academic, non-academic, scientists and budding researchers to help and updates the bioinformatics/computational biology jobs links of all know websites around the world.

I also love to stream the live bioinformatics or Computational biology jobs updates using Twitter https://twitter.com/search?q=bioinformatics%20jobs&src=typd

Find out here about exciting job opportunities in the life sciences.

Please add well known bioinformatics jobs websites below in comment section.

Address of the bookmark: http://www.nature.com/naturejobs/science/jobs?utf8=%E2%9C%93&q=bioinformatics&where=&commit=Find+Jobs

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/

Lab page @ http://www.mathomics.cl/