Problem :

The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.

CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.

Find step wise explanationand implementation steps at http://dna.cs.byu.edu/bio465/Labs/hmm.shtml

Source code with explanation http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/

Fore detail understanding of HMM read this excellent tutorial http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf

Viterbi Algo at http://en.wikipedia.org/wiki/Viterbi_path

For firther reading Wiki page http://en.wikipedia.org/wiki/Hidden_Markov_model

On CpG island paper and for indepth understanding http://www.biomedcentral.com/1471-2164/12/S2/S10

If you are more interested in exploring Markov Chain Exploration and understand it with graphical version please visit http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&lngWId=1

Reference:

1.http://www.planet-source-code.com

2. http://www.tannerhelland.com

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

the study of the sequence-structure relationship
(application -> structure prediction)
the study of the structure-function relationship
(application -> function prediction)

Therefore, anything related to the configuration (sequence) and conformation (structure) in atomic systems of proteins and nucleic acids, and the interaction of these with other elements (function) is of our major interest.

Lab page @ http://melolab.org/mbl/

http://www.sidowlab.org/

1 Scientist E 3

50,000/-

M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject.

Minimum 8 Yrs. of experience after M.Sc. or 5 Yrs. of experience after Ph.D. in responsible position of work in R & D in the area of genomics/ conservation biotechnology/bioinformatics/Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 40yrs.

2 Scientist B 6

30,000/-

M.Sc. in Life sciences or Plant Sciences or Biotechnology or Microbiology or Bioinformatics or Ph.D. from a recognized university in any of above subject shall be preferred.

Minimum 3 Yrs. of experience after M.Sc. in responsible position of work in R & D in the area of genomics/ conservation biotechnology/ bioinformatics /Planning/Scientific Administration in Science and technology organization. Highly qualified in the area of modern biology, as evidenced through research experience and proven ability to carry out work in the area of conservation biotechnology. Age limit not exceeding 35yrs.

The positions are purely on contractual basis for 11 months. Interested candidates can apply online in specified format available at "http://leogen.in/recruit/" The last date of applying is 24th December, 2013. Applications must be submitted online only. Applications submitted in any other format except online prescribed performa will be rejected. Candidates in service must apply through proper channel. Candidates will be required to provide original documents along with duly filled and signed application Performa, as and when called for interview.

For more details please visit the website URL : http://leogen.in/recruit

Name of the fellowship: Junior Research Fellow (JRF) / Project Fellow

Title of the project: Genome-wide Mapping of Murine Specific Dengue T-cell Epitopes: Computational Prediction, Identification and use as Candidate Vaccines

Duration: 3 years

Fellowship: Rs. 18,000 for first 2 years and Rs. 20,000 for 3rdyear (for M.Tech. candidates)

Rs. 16,000 for first 2 years and Rs. 18,000 for 3rdyear (for M.Sc. candidates with NET qualification)

Rs. 8,000 for first 2 years and Rs. 10,000 for 3rdyear (for M.Sc. candidates without NET qualification)

Qualifications: M.Tech. in Biotechnology / M.Sc. in any branch of Life Sciences

Desirable Experience: Minimum of two years research experience in any of the following areas: Immunology / Microbiology / Gene Manipulation / Bioinformatics

Interested and eligible candidates may apply with their resume along with relevant documents and a passport size photograph to the Principal Investigator by post (or e-mail) on or before December 31, 2013. Only short listed candidates will be called for written test and/or interview. Selected candidate may register for PhD in Kalasalingam University. No TA/DA will be paid for attending interview.

Dr. K. Sundar
Principal Investigator (SERB Project)
Department of Biotechnology
Kalasalingam University
Krishnankoil – 626126, Tamil Nadu
sundarkr@klu.ac.in

Research Area:
Linear models for microarray data
Digital gene expression technologies
Detection of molecular pathways
Bioinformatics resources for medical research

Link @ http://www.wehi.edu.au/faculty_members/professor_gordon_smyth/

Established by Government of Rajasthan

Approved by UGC under Sec 2(f) of UGC Act 1956

ADVERTISEMENT FOR FACULTY POSITION AT JAIPUR NATIONAL UNIVERSITY,JAIPUR

Jaipur National University, Jaipur is a premier centre of learning, providing various integrated and interdisciplinary programmes of study and research in the country. With the opening of the School of Distance Education & Learning, JNU has taken education to the doorsteps of those aspirants who, for some reason, could not be a part of regular stream of education. In this era of competition & ambition for excellence, it has become imperative to have quality education & an alert mind coupled with the right attitude to carry onself, and for this, JNU happens to be the most sought after destination.

School Of Life Sciences: Bioinformatics, Chemistry

Total no of Post: 04

Education:

PG – M.Sc /M.Tech Bioinformatics

PG – M.Sc /M.Tech Chemistry

Experience:

Candidate with 1-2 years of teaching experience in college/ University will be preffered. Freshers may also apply.

Compensation: Compensation will not be a problem for the right candidate

HOW TO APPLY:

SEND THE UPDATED RESUME THROUGH MAIL OR POST AT

dsbhatia5@yahoo.com

contact no: 7568246839

Website: http://www.jnujaipur.ac.in

Please mail your resume to Prof.D.S.Bhatia

Email Address: dsbhatia5@yahoo.com

Ph:, +917568246839