This is necessary in light of the increasing use of higher level statistics in biomedical research. I hope it accomplishes this mission and encourage its free distribution and use as a course text or supplement.

K Seefeld, May 2007

We use algorithms every day. For example, a recipe for baking a cake is an algorithm. Most programs, with the exception of some artificial intelligence applications, consist of algorithms. Inventing elegant algorithms -- algorithms that are simple and require the fewest steps possible -- is one of the principal challenges in programming. An algorithm is a description of a procedure which terminates with a result. In other words an algorithm is a set of instructions, sometimes called a procedure or a function, that is used to perform a certain task. This can be a simple process, such as adding two numbers together, or a complex function, such as adding effects to an image. For example, in order to sharpen a digital photo, the algorithm would need to process each pixel in the image and determine which ones to change and how much to change them in order to make the image look sharper.

In mathematics, computer science, and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields.
Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness.

History

The origin of the term comes from the ancients. The concept becomes more precise with the use of variables in mathematics. Algorithm in the sense of what is now used by computers appeared as soon as first mechanical engines were invented.
The word algorithm comes from the name of the 9th century Persian Muslim mathematician Abu Abdullah Muhammad ibn Musa Al-Khwarizmi. The word algorism originally referred only to the rules of performing arithmetic using Hindu-Arabic numerals but evolved via European Latin translation of Al-Khwarizmi's name into algorithm by the 18th century. The use of the word evolved to include all definite procedures for solving problems or performing tasks.
The algorithm of Archimedes gives an approximation of the Pi number.
Eratosthenes has defined an algorithim for retrieving prime numbers.
Averroès (1126-1198) was using algorithmic methods for calculations.
Adelard de Bath (12 th) introduces the algorismus term, from Al-Khwarizmi.
During the 1800's up to the mid-1900's:

- George Boole (1847) has invented the binary algebra, the basis of computers. Actually he has unified logic and calculation in a common symbolism.

- Gottlob Frege (1879) formula language's, that is a lingua characterica, a language written with special symbols, "for pure thought", that is free from rhetorical embellishments... constructed from specific symbols that are manipulated according to definite rules.

- Giuseppe Peano (1888) It's The principles of arithmetic, presented by a new method was the first attempt at an axiomatization of mathematics in a symbolic language.

- Alfred North Whitehead and Bertrand Russell in their Principia Mathematica (1910-1913) has further simplified and amplified the work of Frege.

- Kurt Goëdel (1931) cites the paradox of the liar that completely reduces rules of recursion to numbers.

The concept of algorithm was formalized in 1936 through Alan Turing's Turing machines and Alonzo Church's lambda calculus, which in turn formed the foundation of computer science.
Stephen C. Kleene (1943) defined his now-famous thesis known as the "Church-Turing Thesis". In this context:

" Algorithmic theories... In setting up a complete algorithmic theory, what we do is to describe a procedure, performable for each set of values of the independent variables, which procedure necessarily terminates and in such manner that from the outcome we can read a definite answer, "yes" or "no," to the question, "is the predicate value true?"

Classification

Classification by purpose

Each algorithm has a goal, for example, the purpose of the Quick Sort algorithm is to sort data in ascending or descending order. But the number of goals is infinite, and we have to group them by kind of purposes:

Classification by implementation

An algorithm may be implemeted according to different basical principles.

• Recursive or iterative

A recursive algorithm is one that calls itself repeatedly until a certain condition matches. It is a method common to functional programming. 
Iterative algorithms use repetitive constructs like loops.
Some problems are better suited for one implementation or the other. For example, the towers of hanoi problem is well understood in recursive implementation. Every recursive version has an iterative equivalent iterative, and vice versa.

• Logical or procedural

An algorithm may be viewed as controlled logical deduction. 
A logic component expresses the axioms which may be used in the computation and a control component determines the way in which deduction is applied to the axioms. 
This is the basis of the logic programming. In pure logic programming languages the control component is fixed and algorithms are specified by supplying only the logic component.

• Serial or parallel

Algorithms are usually discussed with the assumption that computers execute one instruction of an algorithm at a time. This is a serial algorithm, as opposed to parallel algorithms, which take advantage of computer architectures to process several instructions at once. They divide the problem into sub-problems and pass them to several processors. Iterative algorithms are generally parallelizable. Sorting algorithms can be parallelized efficiently.

• Deterministic or non-deterministic

Deterministic algorithms solve the problem with a predefined process whereas non-deterministic algorithm must perform guesses of best solution at each step through the use of heuristics.

Classification by design paradigm

A design paradigm is a domain in research or class of problems that requires a dedicated kind of algorithm:

• Divide and conquer

A divide and conquer algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively), until the instances are small enough to solve easily. One such example of divide and conquer is merge sorting. Sorting can be done on each segment of data after dividing data into segments and sorting of entire data can be obtained in conquer phase by merging them.
The binary search algorithm is an example of a variant of divide and conquer called decrease and conquer algorithm, that solves an identical subproblem and uses the solution of this subproblem to solve the bigger problem.

• Dynamic programming

The shortest path in a weighted graph can be found by using the shortest path to the goal from all adjacent vertices. 
When the optimal solution to a problem can be constructed from optimal solutions to subproblems, using dynamic programming avoids recomputing solutions that have already been computed. 
- The main difference with the "divide and conquer" approach is, subproblems are independent in divide and conquer, where as the overlap of subproblems occur in dynamic programming. 
- Dynamic programming and memoization go together. The difference with straightforward recursion is in caching or memoization of recursive calls. Where subproblems are independent, this is useless. By using memoization or maintaining a table of subproblems already solved, dynamic programming reduces the exponential nature of many problems to polynomial complexity.

• The greedy method

A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage. Instead a "greedy" choice can be made of what looks the best solution for the moment. 
The most popular greedy algorithm is finding the minimal spanning tree as given by Kruskal.

• Linear programming

The problem is expressed as a set of linear inequalities and then an attempt is made to maximize or minimize the inputs. This can solve many problems such as the maximum flow for directed graphs, notably by using the simplex algorithm. 
A complex variant of linear programming is called integer programming, where the solution space is restricted to all integers.

• Reduction also called transform and conquer

Solve a problem by transforming it into another problem. A simple example: finding the median in an unsorted list is first translating this problem into sorting problem and finding the middle element in sorted list. The main goal of reduction is finding the simplest transformation possible.

• Using graphs

Many problems, such as playing chess, can be modeled as problems on graphs. A graph exploration algorithms are used. 
This category also includes the search algorithms and backtracking.

The probabilistic and heuristic paradigm

• Probabilistic

Those that make some choices randomly.

• Genetic

Attempt to find solutions to problems by mimicking biological evolutionary processes, with a cycle of random mutations yielding successive generations of "solutions". Thus, they emulate reproduction and "survival of the fittest".

• Heuristic

Whose general purpose is not to find an optimal solution, but an approximate solution where the time or resources to find a perfect solution are not practical.

Classification by complexity

Some algorithms complete in linear time, and some complete in exponential amount of time, and some never complete.

Algorithms resources on net.

Graph Algorithms in Bioinformatics

Bioinformatics Algorithms Description

Bioinformatics Algorithms Course Page

Bioinformatics Algorithm Demonstrations

Introduction to Bioinformatics Algorithms Lectures 1-2 by Dr. Max Alekseyev USC, 2009

Online Lectures on Bioinformatics

Sequence Alignment Algorithms

Algorithm for sequence alignment: dynamic programming

Network Protocol Analysis using Bioinformatics Algorithms

Bioinformatics Algorithms Links

Dynamic Programming

Particularly good sites...

•http://www.cis.upenn.edu/~sahuguet/MSA/
•http://www.blc.arizona.edu/courses/bioinformatics/align.html
•http://www.cs.monash.edu.au/~lloyd/tildeStrings/Notes/DPA.html
•http://www.cs.orst.edu/~schut/cs325/dynamic.htm
•http://www.catalase.com/dprog.htm
•http://bioweb.ncsa.uiuc.edu/~bioph490/BIOPH2.html#SEQUENCE_COMP
•http://www.qucis.queensu.ca/home/cisc365/javascript/dp1/index.html
Other sites...
•http://bioweb.ncsa.uiuc.edu/~bioph490/dynamic_programming_demo.html
•http://www.qucis.queensu.ca/home/cisc365/365overheads.html
•http://www.qucis.queensu.ca/home/cisc365/dp/dp.p01.html
•http://www.dgp.toronto.edu/csc270/tut_dp.html
•http://queue.ieor.berkeley.edu/~jshu/knapsack/DP/dp.html
•http://mat.gsia.cmu.edu/classes/dynamic/dynamic.html
•http://www.cs.sandia.gov/~scistra/class_3
•http://levine.sscnet.ucla.edu/Econ101/dynamic.htm
•http://mat.gsia.cmu.edu/classes/stoch_dynamic/stoch_dynamic.html
•http://mat.gsia.cmu.edu/classes/dynamic/node8.html
•http://www.maths.mu.oz.au/~moshe/dp/bibl/bibliography.html
•http://cartan.gmd.de/PAPER/ismb95/ismb_html.html
•http://screwdriver.bu.edu/bibliography/dynamic_programming.htm
•http://www.norvig.com/design-patterns/
•http://tome.cbs.univ-montp1.fr/htmltxt/Doc/manual/node137.html
•http://poem.princeton.edu/~verdu/dynamic.html
•http://www.orca1.com/opushelpweb/opusDynamic_Programming.html
•http://screwdriver.bu.edu/cn760-lectures/l7/index.htm
•http://www.ms.unimelb.edu.au/~moshe/dp/dp.html
•http://mat.gsia.cmu.edu/ORCS/0255.html
•http://aae.wisc.edu/e703/notes/a13dynpr.htm
•http://bioweb.pasteur.fr/docs/modeller/node137.html
•http://www2.uwindsor.ca/~lama/my470/ddynamic.htm
•http://students.ceid.upatras.gr/~papagel/project/ex5_6_1.htm
•http://www.cs.sunysb.edu/~algorith/lectures-good/node12.html
•http://www.cs.sunysb.edu/~algorith/lectures-good/node12.html
•http://www.utdallas.edu/~scniu/documents/7315.htm
•http://www.ii.uib.no/~pinar/seminar/larry.html
•http://www.deakin.edu.au/~gecole/books.html
•http://www.cseg.engr.uark.edu/~wessels/algs/notes/dynamic.html
•http://www.csc.liv.ac.uk/~ped/teachadmin/algor/dyprog.html
•http://www.eli.sdsu.edu/courses/fall96/cs660/notes/dynamicProg/dynamicProg.html
•http://www.cs.indiana.edu/l/www/ftp/techreports/TR514.html
•http://www.cs.brandeis.edu/~mairson/poems/node3.html
•http://www.cis.tu-graz.ac.at/igi/oaich/animations/Dynamic2.html
•http://bioweb.ncsa.uiuc.edu/~workshop/

Smith Waterman
•http://genome-www.stanford.edu/Saccharomyces/help/sw_alignment.html
•http://genome-www.stanford.edu/Saccharomyces/help/sw_details.html
•http://www.stanford.edu/~sntaylor/bioc218/final.htm
•http://www.maths.tcd.ie/~lily/pres2/sld009.htm
•http://bioweb.ncsa.uiuc.edu/~workshop/Lab_3/Smith-Waterman.htm
•http://www.tigem.it/LOCAL/SW/threshold.html
•http://sgbcd.weizmann.ac.il/genweb/help/smith-waterman.html
•http://cbrg.ethz.ch/ServerBooklet/section2_3_5.html
Needleman & Wunsch
•http://www.maths.tcd.ie/~lily/pres2/sld003.htm
•http://acer.gen.tcd.ie/~amclysag/nwswat.html
•http://www.nada.kth.se/~erikw/thesis/chapter2_3.html
•http://www.irbm.it/irbm-course95/gb/docs/amps/subsection3_6_1.html
•http://www.ibc.wustl.edu/~zuker/Bio-5495/align-html/node3.html

General (NW vs. SW vs. HMM, etc.)

•http://www.maths.tcd.ie/~lily/pres2/
•http://acer.gen.tcd.ie/~amclysag/nwswat.html
•http://laguerre.psc.edu/biomed/TUTORIALS/SEQUENCE/MULTIPLE/tutorial.html
•http://www.cse.ucsc.edu/research/compbio/

Hmms

•http://www.medmicro.mds.qmw.ac.uk/HMMER/main.html
•http://alfredo.wustl.edu/ismb96/abs/p02.html
•http://www.cse.ucsc.edu/research/compbio/html_format_papers/hughkrogh96/cabios.html
•http://wwwsyseng.anu.edu.au/~jason/hmmlinks.html
•http://www.breadfan.com/markov.html
•http://cslu.cse.ogi.edu/HLTsurvey/ch1node34.html
•http://www.ibc.wustl.edu/service/hmmalign/glocal.html
•http://www.cse.ucsc.edu/research/compbio/html_format_papers/ismb94/node5.html
•http://www.iscs.nus.edu.sg/~luakt/ic3222/lecture/nlp18new/index.htm
•http://www.cse.ucsc.edu/research/compbio/sam.html SAM Software for HMMs

Genetic Algorithms

•http://www.staff.uiuc.edu/~carroll/ga.html
•http://kal-el.ugr.es/gags.html
•http://kal-el.ugr.es/~jmerelo/GAJS.html
•http://www.genetic-programming.org/
•http://www.iitk.ac.in/kangal/deb_tut.shtml

Blog : http://blogs.plos.org/biologue/2012/12/28/translational-bioinformatics-plos-computational-biology-presents-an-educational-resource-for-an-emerging-field/

Educational Material : http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11

Address of the bookmark: http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11

More at https://boards.greenhouse.io/twistbioscience/jobs/3135495?gh_src=9ecc0b941us

Applications are invited from qualified individuals for a JRF/SRF position (sponsored by DBT/DST) at Prof. Jagan Pongubala’s laboratory, University of Hyderabad. Dr. Pongubala’s laboratory is investigating the molecular pathways that control the development of innate and adaptive immune cell types utilizing a combination of genetic, molecular and computational approaches.

JRF/SRF

Masters degree in Bioinformatics (M.Sc./M.Tech.)

Rs. 12,000+HRA
Rs. 16,000+HRA

Initial appointment is for one year and subjected to renewal up to 2 years

Candidates selected for the above position would have a choice to work on computational biology or experimental biology. Candidates interested to work on computational biology are expected to perform high-throughput sequencing (NGS) data analysis and should have a strong background in Bioinformatics & Computational Biology, good programming skills particularly Perl, Python, R and work experience in Linux environment.

Candidates interested to work on experimental biology should have work experience in techniques that are routinely used in molecular biology and mammalian cell culture. A basic knowledge of bioinformatics is also desired.

Applicants for the above positions should have a Masters degree (M.Tech/M.Sc) with an aggregate marks greater than 70% or a 7.5 CGPA. Candidates having JRF-fellowship through CSIR/UGC/ICMR/DBT will be encouraged to enroll into Ph.D. program. The interested candidates having excellent organizational skills and the ability to work in a team environment with an aspiration to learn new techniques and explore new scientific areas are requested to generate their resume using the link https://cvmkr.com/CV/new#0 and forward to pongubalajagan@gmail.com

Review of applications will begin immediately and continue until the position is filled. Eligible candidates will be called for an interview. No TA/ DA will be paid for attending the interview or at the time of joining the post. Applicants should note that the appointment is purely temporary and subjected to renewal up to three years and there is no Right to Claim for any regular appointment with the University.

Corresponding address: Jagan Pongubala, Ph.D.
Department of Animal Sciences
School of Life Sciences, Room:S44
University of Hyderabad
Gachibowli, Hyderabad 500046

Advertisement: https://www.uohyd.ac.in/images/recruitment/jrf-srf_130414.pdf

Bose Institute, Kolkata, invites applications from Indian Citizens for ONE (01) temporary position of Junior Research Fellow in the DBT sponsored project entitled, “Centre of Excellance (CoE) in Bioinformatics at Bose Institute”, running under Prof. Pinakpani Chakrabarti, Project Co-ordinatior, Bioinformatics Centre. The project is tenable upto 31.03.2017, but duration of the fellowship is one year only. The JRF will work with one of the faculty members of the center based on his / her motivation in any specific area on Bioinformatics.

Essential Qualification: 1st class M.Sc. / M.Tech degree in any stream of Chemical/ Biological Sciences with CSIR-UGC-NET-JRF / ICMR-JRF / DBT-JRF or CSIR-UGCNET- LS / GATE qualification.

Desirable qualification:

(i) Specialized knowledge in Organic / Physical chemistry.
(ii) Any exposure to research involving the small molecules (like drug) and / or protein structure determination or prediction.
(iii) Basic knowledge in computer programming, e.g. using FORTRAN, C, shell, perl etc.
(iv) Hands-on-experience on any of the following software : CHARMM/AMBER/NAMD/GROMACS,Gaussian/Gamess, Haddock/Autodock, Schrodinger etc. (or any other software serving similar purposes in molecular modeling)

Fellowship :

(i) Rs. 16,000/- p.m., plus admissible HRA & Medical Benefit for M.Sc. with CSIRUGC NET-JRF/ICMR-JRF/DBT-JRF or M.Tech. with CSIR-UGC NETJRF/
ICMR-JRF/DBT-JRF/CSIR-UGC NET-LS/GATE
(ii) Rs. 12,000/- p.m., plus admissible HRA & Medical Benefit for M.Sc. with CSIRUGC NET-LS/GATE

Age : Below 28 years as on the day on which the application is made (relaxable in case of SC/ST/OBC/WOMEN candidates only as per rule).

Interested and eligible candidates should apply on plain paper duly signed by them clearly mentioning the area of interest in research, possession of any desirable qualification (s) as mentioned above and quoting Advertisement No. on the envelop as well as application with complete Bio-data giving e-mail ID, Phone No. and details of qualification i.e. examination passed, year, division, percentage of marks, from Secondary onwards with attested copies of testimonials, addressed to the Registrar, Bose Institute, P-1/12, CIT Scheme VII-M, Kankurgachi, Kolkata-700054 on or before April 25, 2014.

The shortlisted candidates will be called for an interview. Applicants are advised to check our website for future updates.

Advertisement: www.boseinst.ernet.in/ADVT/14/p_2.pdf

The fate of a cell is ultimately the product of the regulation of its genes. Gene regulation is a coordinated process acting at multiple levels of which transcription and translation are the most prominent. The Valen group is dedicated to the fundamental question of how transcription and translation is integrated to obtain the desired protein abundance. The recent development of high-throughput next generation sequencing techniques to monitor both active translation and transcription has made it possible to study this connection at the genome scale.

This project aims to elucidate the links between regulation of translation and transcription. The applicant will analyze next generation sequencing data and model gene regulation on a genome-wide level to identify the features that affect the translational output of transcripts. The work will be done in close collaboration with experimental scientists who will test the predictions of the computational models.

Additional information on the position can be obtained by contacting Eivind Valen (eivind.valen@ii.uib.no).

The research fellow must take part in the University’s approved PhD program leading to the degree within a time limit of 3 years. Application for admission to the PhD program, including a project plan outline for the training module, will be worked out in collaboration with the research group in question.

In total, the fellowship period is 4 years, 25 % of this will be allocated to teaching and/or administrative duties. The fellowship period may be reduced if the successful applicant has held previous employment as a research fellow or similar.

http://www.jobbnorge.no/en/available-jobs/job/102235/research-fellow-phd-candidate-in-computational-biology-2-positions

The Job detail

Advancing the SNP-discovery and polymorphism assessment work across several germplasm panels representing global genetic diversity
Population genetic and genomic analyses, testing the hypothesis related to adaptation in multiple geographic regions
Develop SNP assays from large scale GBS and other re-sequencing data for several target traits utilizing available phenotyping data
Combined analyses of genotypic and phenotypic data for discovery of marker-trait associations, and conducting GWAS
Processing, analyzing, and archiving large-scale genomic data sets, assessing data quality, conducting analyses, interpreting findings, and communicating findings to others including preparation of reports, presentations, posters and journal articles
Providing support to MSc and PhD students on topic related to its major core of research
Any other work assigned by the supervisor

The Person:

PhD in bioinformatics, genetics, computational biology preferably with 1 to 2 years of experience;
familiar with standard bioinformatics tools and scripting languages and emerging and evolving software platforms relevant to bioinformatics and computational biology;
ability to create new analytical pipelines; experience with handling large data sets;
ability to program in at least two of the following: C++, PERL, Python, R, Java.
will use next-generation sequencing technologies to generate marker data for genetic mapping and transcriptome data for expression QTL mapping, and will be responsible for data generation as well as data analysis.

Period and Remuneration: The assignment is for a period of two years, and can be extended for another year depending on performance. ICRISAT pays a very attractive all inclusive lump sum assignment fee payable in Indian Rupees.

How to Apply: Please send your application by email to icrisatjobs@cgiar.org, stating the job title (Special project Scientist-Sorghum Genomics) clearly in the subject column, addressed to the Director, Human Resources and Operations, ICRISAT, Patancheru, Andhra Pradesh 502 324, India, latest by 10 June 2014. The application should include an up-to-date Curriculum Vitae, a short statement of competencies and experience for the position, and the names and addresses (including phone/e-mail) of three referees. Only short-listed candidates will be contacted.

More at: http://www.icrisat.org/careers/Special-Project-Scientist-Sorghum-Genomics.htm

Walk- in- Test cum Interview (based on test) for the selection of Research Associate

under the scheme “Distributed Information Sub Centre –DISC” & Research Assistant under scheme “Phytophthora, Fusarium and Ralstonia diseases of Horticultural and Field Crops” will be held at this Institute as per details indicated below.

WALK -IN- TEST CUM INTERVIEW

Name of the post : Research Associate

Date of Interview : 21-05-2014 at 10.00 AM

No. of posts : One

Qualifications : a)Essential

Ph.D Degree in Bioinformatics OR : Masters degree in Bioinformatics with a minimum of
60% marks or equivalent OGPA with at least two years research experience as evidenced from fellowship/ associateship/training/published papers etc.

b)Desirable: Experience in NGS data analysis.

Emoluments : Rs. 23,000/- per month + HRA (Masters Degree Holders)

Rs. 24,000/- per month + HRA (Ph.D Degree Holders)

Upper age limit : 40 years for Men & 45 years for Women as on date of Interview (Upper Age limits are relaxable for SC, ST and OBC candidates as per Govt. of India norms (at present 5 years for SC/ST and 3 years for OBC)

Duration of Project : Till 31-03-2017.

Title of Assigment : Research Assistant (on contract basis)

No. of vacancy : One

Qualification : Essential : Post Graduation in Bioinformatics and Minimum one year experience in NGS data analysis

Desirable : Experience in Perl/Python/R

Remuneration : Rs. 20,000/- per month (consolidated)

Scope of work :

1. Analysis of different file formats and their conversions.

2. Assessing the quality of data and filtering of raw reads.
3. Assembling the raw reads-de novo as well as reference mapping.
4. Compression of aligned reads using Jam tools
5. RNA-seq. Analysis
6. Differential expression testing involving Normalization, Statistical testing, heat map generation & hierarchical clustering
7. Annotating the assembled genome and geneet testing and their validation
8. Metabolic pathway analysis
9. Comparative genomics
10. Setting up of genome browsers.

Period of Assigment : Initially for six months.

Date & Venue of Interview : 21-05-2014 at IISR, Kozhikode at 10.00 AM

More at http://www.spices.res.in/pdf/disc-advtmnt.pdf

Chettinad Academy of Research and Education (CARE) invites applications from eligible and translational research-oriented candidates to the posts of Professor/Associate Professor/ Assistant Professor Computational Biology, Bioinformatics, and Pharmaceutical Chemistry.

Emoluments: As per UGC norms (Adequate Compensation for Postdoctoral/Teaching experience)

Candidates fulfilling the eligibility criteria as per the UGC norms can send their full CV with copies of certificates and reference letters to the following address by post or by e-mail on or before 31st May 2014

The Registrar,
Chettinad Academy of Research and Education,
Chettinad Health City
Kelambakkam, Chennai 603 103
Tamil Nadu
T +91 (0)44 4741 1000
F +91 (0)44 4741 1011
Email: jobs @chettinadhealthcity.com

Advertisement: http://182.73.176.163/chc/ads2014.pdf