Essential Qualifications:
First class M. Tech or M.E. in computer science or information technology or bioinformatics with 4 years of R&D experience (after Master’s Degree) in an R&D organization with work profile of large data assembly, analysis, and/or customer/user-based software programming and/or, program implementation, database development evidenced by patents and/or publications, credible scale of R&D related data/data sets submission to public database for expanded use etc. Company Info.
Centre for Innovative and Applied Bioprocessing

CENTER OF INNOVATIVE AND APPLIED BIOPROCESSING (A National Institute under Dept. of Biotechnology, Ministry of Science & Technology, Govt. of India) 2nd Floor, C-127, Phase VIII, Industrial Area, S.A.S. Nagar, Mohali-160071(Pb). Additional Information States & U.T State & Union Territories Punjab How To Apply Apply Details
Apply directly.. Web/Notification URL http://ciab.res.in/vacancies/CIAB-Rollin g%20Advt-2015.pdf

Eligibility : ME/M.Tech(Bio-Informatics/Bio-Chemistry Engg, CSE), MSc(Bio-Informatics, CS)

Location : Delhi

Last Date : 18 Dec 2015

Hiring Process : Walk - In
IARI - Job Details

JRF/Traineeship/Studentship Bioinformatics job position in Indian Agricultural Research Institute (IARI) purely temporary

JRF

Qualification: i) Master’s degree in Bioinformatics or Computer Science + NET qualification, or ii) M. Tech degree in Bioinformatics or Computer Science/Engineering

Desirable: Efficiency to handle agricultural databases and bioinformatics tool development

Pay Scale :Rs 25000/-

Age limit : 35 years

Traineeship/2 Post

Qualification: M.Sc./M. Tech (Bioinformatics) with 60 % marks from a recognized University

Pay Scale :Rs. 8000/-consolidated

Age limit : 35 years

Studentship/4 Post

Qualification: Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University

Pay Scale :Rs. 8000/-consolidated

Age limit : 35 years
How to apply

Walk-in-Interview will be held on 18th December 2015 at 10:00 AM at AKMU, LBS Building,IARI, Pusa Campus, New Delhi-110012. Bring self attested copies and originals of all certificates ( class 10th )onwards along with biodata in the attached format, proof of date of birth, one passport size photo, NOC from present employer, if any.

More at http://www.iari.res.in/index.php?option=com_jumi&fileid=24&Itemid=664

Eligibility : ME/M.Tech(Bio-Informatics/Bio-Chemistry Engg), MSc(Bio-Informatics)

Location : Hyderabad

Last Date : 30 Dec 2015

Hiring Process : Written-test
University of Hyderabad

JRF Bioinformatics job position in University of Hyderabad

Project Entitled : Programming protective humoral responses with novel vaccine formulations against Dengue Virus

Essential Qualifications : M. Sc. in Life Sciences/Bioinformatics/ or M. Tech in Bioinformatics with a minimum of 60% marks and with CSIR-UGC JRF/NET or valid GATE score are preferred. Desirable : Candidates should have six months to one year hands on experience in molecular biology techniques like gene cloning, protein expression and purification, hands on various nano-formulations for drug/vaccine delivery, immunological assays including animal handling, immunizations, T cells and B cell assays or Candidate should have strong background in Bioinformatics and computational Biology, good programming skill particularly proficiency in R/PERL/PYTHON. Candidates interested in above position should send a one page statement clearly explaining how their skills are relevant to the above said position. The candidates should also enclose detailed CV and the name/Email IDs of three references

Fellowship : Rs. 16,000 p.m. + 30% H.R.A. for the first two years (Revised DBT fellowship guidelines maybe applicable)

Duration : The appointment will be on temporary basis for a period of one year. Based on performance, the appointment could be extended till the end of project

How to apply

Submit your application (hardcopy) in a closed envelope to Dr.Nooruddin
Khan, Room S-66B,Department of Biotechnology and Bioinfromatics, School of Life Sciences, University of Hyderabad, Gachibowli, Hyderabad 500 046 or E mail: nklabsls@gmail.com. Last date for receipt of applications is on or before 30.12.2015

More at http://uohyd.ac.in/index.php/component/content/article/87-administration/recruitments/129

It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.

CrossMap is designed to liftover genome coordinates between assemblies. It’s not a program for aligning sequences to reference genome.

We do not recommend using CrossMap to convert genome coordinates between species.

More at http://crossmap.sourceforge.net/

Address of the bookmark: http://crossmap.sourceforge.net/

Bhubaneswar 751023

Advt No. 07/2016

Institute of Life Sciences (ILS), Bhubaneswar, an autonomous Institute of the Department of Biotechnology, Ministry of Science & Technology, Government of India engaged in advanced research invites applications from Indian nationals for the Ph.D. program. The main focus of the projects will be computational biology in the following areas.

S. No. Area of Research Principal investigator

1. Computational Cancer Biology Dr. Anshuman Dixit

2. Immunogenomics & Systems Biology Dr. Sunil Kumar Raghav

3. Chromatin remodeling and hematopoiesis Dr. Punit Prasad

Candidates are strongly encouraged to visit ILS webpage for detailed information, regarding the research activities of the above mentioned scientists.

Essential Qualifications:

(a) Eligibility: M.Sc., M.V.Sc., M.Pharm., M.S. Pharma. (with NET/GATE/GPAT/BINC/any other equivalent national level exam) or M.Tech with minimum of 60% marks (or equivalent grade point). Those awaiting final result may also apply.

Applications received after the last date will not be accepted. The envelope should clearly be superscribed with “Application for Ph.D. program (computational biology)”. Short-listed candidates selected for the interview will be published in the Institute website (www.ils.res.in).

Application Fees: Applicants except SC/ST candidates are required to send a non-refundable D.D. for Rs.100/- in favour of “Director, Institute of Life Sciences, Bhubaneswar” payable at Bhubaneswar along with duly filled-in application form by the date mentioned below. Director, ILS reserves the right to withdraw the procedure without assigning any reasons thereof.

Important dates: 

Last date of receiving applications: 24th June 2016 

Date of display of short-listed candidates and instructions on the Institute website: 30th June 2016 

Date of interview: The interview will be organized on 25th July 2016

Advertisement: https://www.ils.res.in/wp-content/uploads/2016/05/advt07-16.pdf

Nearly 20% of the such journals have a flashy impact factor and quick publication time, which are quick give-aways. Interestingly, under contact address, some journal websites do not even provide any address to contact. All of this has led to the emergence of a new and dark market of deceptive publishers that exploit the concept of open access and provide channels for “scientific journal” publication with little or no peer review. For a fee, they will publish almost anything – even if the study was fatally flawed. And these journals provide a forum that can be used as a channel to publish fraudulent “advocacy research.” You can find list of certain such publishers at "Beall's List" http://beallslist.weebly.com/

Keeping all these in mind, Government of India (GOI) decided to approved certain bioinformatics and computational biology journals for your research publication.

Following are the list of GOI validated and peer reviewed bioinformatics and computational biology journals:

NOTE:Each journal details are in following order Tittle\nSource\nSubject.
Point to remember: The list of journals are NOT sorted in any ascending or descending order.

If I missed any other GOI validated bioinformatics journal, then please report me in comment section.

Open Bioinformatics Journal
Scopus
Computer Science; Engineering; Medicine

PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS
WoS
BIOLOGY & BIOCHEMISTRY

Advances and Applications in Bioinformatics and Chemistry
Scopus
Biochemistry, Genetics and Molecular Biology Chemistry; Computer Science

Advances in Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science; Engineering

Applied Bioinformatics
Scopus
Agricultural and Biological Sciences; Computer Science

BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

Bioinformatics and Biology Insights
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science; Mathematics

BMC BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

BRIEFINGS IN BIOINFORMATICS
WoS & Scopus
COMPUTER SCIENCE

Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference
Scopus
Medicine

Current Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

Current Protocols in Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology

JOURNAL OF COMPUTATIONAL INTELLIGENCE IN BIOINFORMATICS
ICI
BIOLOGICAL SCIENCE

Journal of integrative bioinformatics
Scopus
Medicine

Journal of Proteomics and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science

Mathematical Biology and Bioinformatics
Scopus
Engineering; Mathematics

Trends in Bioinfprmatics
Scopus
Computer Science

Eurasip Journal on Bioinformatics and Systems Biology
Scopus
General; Computer Science; Mathematics; Medicine

Evolutionary Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

Genomics, Proteomics and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Mathematics

IEEE/ACM Transactions on Computational Biology and Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Mathematics

IEEE-ACM Transactions on Computational Biology and Bioinformatics
WoS
COMPUTER SCIENCE

International Journal of Bioinformatics Research and Application
Scopus
Biochemistry, Genetics and Molecular Biology; Medicine, Health

International Journal o f Data M ining and Bioinformatics
WoS & Scopus
COMPUTER SCIENCE

IPSJ Transactions on Bioinformatics
Scopus
Biochemistry, Genetics and Molecular Biology;Computer Science

Journal of Bioinformatics and Computational Biology
WoS & Scopus
COMPUTER SCIENCE

Journal of Clinical Bioinformatics
Scopus
Medicine

PLoS Computational Biology
WoS & Scopus
BIOLOGY & BIOCHEMISTRY

Reviews in Computational Chemistry
WoS & Scopus
CHEMISTRY

RSC Theoretical and Computational Chemistry Series
Scopus
Chemistry; Computer Science

Annual Reports in Computational Chemistry
Scopus
Chemistry; Mathematics

Computational and Structural Biotechnology Journal
Scopus
Biochemistry, Genetics and Molecular Biology; Computer Science

Computational and Theoretical Chemistry
WoS & Scopus
CHEMISTRY

COMPUTATIONAL BIOLOGY AND CHEMISTRY
WoS & Scopus
COMPUTER SCIENCE

COMPUTATIONAL CHEMISTRY
WoS
CHEMISTRY

Journal of Theoretical and Computational Chemistry
Scopus
Chemistry; Computer Science

Theoretical and Computational Chemistry
Scopus
Chemistry

Wiley Interdisciplinary Reviews: Computational Molecular Science
Scopus
Biochemistry, Genetics and Molecular Biology;Chemistry; Computer Science; Materials Science; Mathematics

Wiley Interdisciplinary Reviews- Computational Molecular Science
WoS
CHEMISTRY

Interdisciplinary sciences, computational life sciences
Scopus
Medicine

Interdisciplinary Sciences-Computational Life Science
WoS
Biology and Biochemistry

International Journal of Computational Biology and Drug Design
Scopus
Computer Science; Pharmacology, Toxicology and Pharmaceutics

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

www.cytosolve.com

Post - System Biologist

Job Description: Role of system biology is to design quantitative models of bimolecular networks and to study interactions between the components of biological systems, and how these interactions give rise to the function and behavior of that system (Enzyme, metabolites and pathway).

Qualification : B.Tech or M.Sc in Bioinformatics

Required Skills:

1) Basic knowledge of cell signaling pathways, chemical/enzyme kinetics, and differential equation based modeling approach.
2) Previous laboratory experience could be an advantage
3) Good Communication skills.

santhiya.ram@mproductions.com and 044-42946555.

JRF/SRF / Project Assistant-II recruitment in National Agri-Food Biotechnology Institute (NABI)

Essential Qualification: According to the DST (DST OM No.SR/S9/Z-09/2012 dated 21.10.2014) Post Graduate degree in basic science(M.Sc) in Bioinformatics/Computational Biology/Systems Biology/Information Technology with NET or Graduate degree in professional course with NET or Post Graduate Degree (M.Tech) in professional course in Bioinformatics/Computational Biology/Systems Biology/Information Technology. Desirable qualification/skills: 1) Should be proficient in programming in Perl/Python/R language etc. 2) Should have knowledge and skills for data mining in biological sequence database . sequence analysis tools/packages, NGS Analysis . 3) Should have knowledge and skills to work in linux environment and write shell scripts.

Age : 28 years

Hiring Process : Written-test
Job Role : Research/JRF/SRF
How to apply

Application should be sent to Administrative officer, National Agri-Food Biotechnology Institute, Knowledge City, Sector-81, Mohali so as to reach latest by 30.05.2017 before 5:30 pm.

More at http://www.nabi.res.in/Vacancies/NABI/ResearchFellowships/JRFSRFRA/2017/ADVT.%20No%202017Researcher%20(02)/ApplicationForm.pdf