• Bioconductor – A plethora of tools for analysis and comprehension of high-throughput genomic data, including 1500+ software packages. [ paper-2004 | web ]
• Biopython – Freely available tools for biological computing in Python, with included cookbook, packaging and thorough documentation. Part of the Open Bioinformatics Foundation. Contains the very useful Entrez package for API access to the NCBI databases. [ paper-2009 | web ]
• Bioconda – A channel for the conda package manager specializing in bioinformatics software. Includes a repository with 3000+ ready-to-install (with conda install) bioinformatics packages. [ paper-2018 | web ]
• BioJulia – Bioinformatics and computational biology infastructure for the Julia programming language. [ web ]
• Rust-Bio – Rust implementations of algorithms and data structures useful for bioinformatics. [ paper-2016 ]
• SeqAn – The modern C++ library for sequence analysis.

The 2014 CeMM PhD Program will focus on two thematic areas: INFECTION and CANCER, that are built on the pillars of epigenetics, bioinformatics and systems biology, chemical biology and the mechanism of action of drugs, high-throughput genetics, genomics and proteomics, and molecular and cell biology.

The choice of this strategic focus rests on the synergies between immunology, infection and cancer in pathophysiological and technological terms. It furthermore reflects the strength of the current CeMM faculty, itself built around the historical and contemporary expertise in immunology and cancer of the Medical University of Vienna.

As a CeMM PhD student you will get the chance to work at the cutting edge of interdisciplinary molecular medicine research and be trained by the entire CeMM and associated faculty to become one of the scientists shaping the future of molecular medicine.
Requirements

To be eligible to enroll in the CeMM PhD Program all candidates are required to have a bachelor’s or master’s degree in medicine, biology, chemistry, bioinformatics, mathematics or any scientific/technical, subject-relevant degree. Candidates do not need to have completed their degree at the time of application, however they must have obtained their final degree certificate by mid-September. The working language at CeMM is English, so excellent written and oral communication skills in English are required.
Timeline

Applications open on 20th January and close on 20th March 2014.
Two references are required to be submitted through the online system by 31st March 2014.
All complete candidate applications are reviewed by the CeMM Faculty in early April.
Selected candidates are invited to a Skype panel interview in late April.
Shortlisted candidates are then invited to Vienna in May for a full interview process, including an opportunity to introduce yourself through a presentation and interview rounds, meet research group members, and attend an informal dinner to get to know the Faculty members and learn more about their research.
Positions are offered by CeMM Faculty in June.
Start of PhD Program: 1st October 2014 .

Contact

Binia Maria Günther, BEd BA
Human Resources Manager
bguenther@cemm.oeaw.ac.at

Catherine Lloyd, Ph.D.
PhD and Postdoc Program Manager
clloyd@cemm.oeaw.ac.at

More Info: www.cemm.oeaw.ac.at/phd-program/application/

No. CSE/14/1038

Walk in Interview for the post of JRF under TEQIP-II

SN Department – Qualification Post Graduation – Time

1 Bio-Informatics & Mathematics M.Tech Bio-informatics/M.Sc.* Maths 10.00 AM

2 Biological Sciences M.Sc.* in any branch of Biological Sciences 10.30 AM

3 Chemical Engineering M.Tech Chemical Engineering 11.00 AM

4 Chemistry M.Sc.* Chemistry 11.30 AM

5 Civil Engineering M.Tech Structure/GeoTech. /Water -Resources/Hydraulics/Environment/Transport 12.00 Noon

6 GIS M.Tech GIS/Civil 12.30 PM

7 Computer Science & Engineering M.Tech CSE/Information Security 01.00 PM

8 Electrical Engineering M.Tech Electrical Derives 01.30 PM

9 Electronics & Communication M.Tech Digital Communication 02.00 PM

10 MSME M.Tech Material Science/ Mechanical/Metallurgy 02.30 PM

11 Physics M.Sc.* Physics 03.00 PM

* M.Sc. with NET/GATE qualified

Resume along with one passport size photograph and relevant documents are required at the time of interview

Amount of Fellowship: Rs 18000/-month+ HRA

Duration: 31st Dec 2014 (End of TEQIP-II project)

Date of Interview: 7th February 2014

Venue Institute Committee Room

Advertisement:

http://www.manit.ac.in/manitbhopal/Year2014/Recruitment/Advertisement%20JRF.pdf

• the Damerau–Levenshtein distance allows insertion, deletion, substitution, and the transposition of two adjacent characters;
• the longest common subsequence (LCS) distance allows only insertion and deletion, not substitution;
• the Hamming distance allows only substitution, hence, it only applies to strings of the same length.
• the Jaro distance allows only transposition.

use Text::Levenshtein qw(distance);

 print distance("foo","four");
 # prints "2"

 my @words     = qw/ four foo bar /;
 my @distances = distance("foo",@words);

 print "@distances";
 # prints "2 0 3"

use Algorithm::LCSS qw( LCSS CSS CSS_Sorted );
    my $lcss_ary_ref = LCSS( \@SEQ1, \@SEQ2 );  # ref to array
    my $lcss_string  = LCSS( $STR1, $STR2 );    # string
    my $css_ary_ref = CSS( \@SEQ1, \@SEQ2 );    # ref to array of arrays
    my $css_str_ref = CSS( $STR1, $STR2 );      # ref to array of strings
    my $css_ary_ref = CSS_Sorted( \@SEQ1, \@SEQ2 );  # ref to array of arrays
    my $css_str_ref = CSS_Sorted( $STR1, $STR2 );    # ref to array of strings

There are many different modules on CPAN for calculating the edit distance between two strings. Here's just a selection.

Text::LevenshteinXS and Text::Levenshtein::XS are both versions of the Levenshtein algorithm that require a C compiler, but will be a lot faster than this module.

The Damerau-Levenshtein edit distance is like the Levenshtein distance, but in addition to insertion, deletion and substitution, it also considers the transposition of two adjacent characters to be a single edit. The module Text::Levenshtein::Damerau defaults to using a pure perl implementation, but if you've installed Text::Levenshtein::Damerau::XS then it will be a lot quicker.

Text::WagnerFischer is an implementation of the Wagner-Fischer edit distance, which is similar to the Levenshtein, but applies different weights to each edit type.

Text::Brew is an implementation of the Brew edit distance, which is another algorithm based on edit weights.

Text::Fuzzy provides a number of operations for partial or fuzzy matching of text based on edit distance. Text::Fuzzy::PP is a pure perl implementation of the same interface.

String::Similarity takes two strings and returns a value between 0 (meaning entirely different) and 1 (meaning identical). Apparently based on edit distance.

Text::Dice calculates Dice's coefficient for two strings. This formula was originally developed to measure the similarity of two different populations in ecological research.

Qualifications

PhD or Post-Graduated Master degree is required. Successful candidates will have some expertise in data analysis of NGS data by using methods running in R and UNIX environment. Familiarity with genome databases and browsers is required.

Application

Candidates should send a CV and a brief personal statement focusing on their skills and interests related to the research project.

Contacts

Start date: 1° April 2014
Salary on grant: 25,000 euros per year.
Contact Person (Referent): Mario Capasso
Ref. Email: mario.capasso@unina.it and achille.iolascon@unina.it
Tel: +39 081 3737889

Address of the bookmark: http://scikit-bio.org/

If you have a license key for Modeller 8 or 9, there is no need to reregister for Modeller 9.13 - the same license key will work. (It won't do any harm to reregister if you want to, though!)

9.13 is primarily a bugfix release relative to the last public release(9.12). Major user-visible changes include:

# Modeller now includes a variety of SOAP (statistically optimized atomic potential) scores for assessing proteins, loops, and interfaces.

# The Lennard-Jones interaction energy is now artificially truncated at very short distance; this makes simulations with poor starting conditions much less likely to 'blow up'.

# model.get_insertions(), model.get_deletions() and model.loops() now have an include_termini option; if False, residue ranges that include chain termini are excluded from the output.

See the Modeller manual for a full change log: http://salilab.org/modeller/9.13/manual/node39.html

If you encounter bugs in Modeller 9.13, please see http://salilab.org/modeller/9.13/manual/node10.html for information on how to report them.

Reference:

http://salilab.org/modeller/

Bii.a-star.edu.sg

Bio research and development. Has course information and research information.

Isb-sib.ch

SIB operates the ExPASy proteomics server and the Swiss node of EMBnet. Teaching activities include a series of post-graduate courses given at the Universities of Geneva and Lausanne, as well as at the EPFL, and a Masters Degree in bioinformatics. Major research areas include the development of integrated databases and software resources in the field of proteomics.

Bioinformatics.ca

Provides information about bioinformatics in Canada. Workshops, certification and resources.

Chickscope.beckman.uiuc.edu

Students raise chicken embryos in the classroom and obtain magnetic resonance images through the Internet.

Bcb.iastate.edu

Graduate program at Iowa State University offering Undergraduate Major (BCBio) and the PhD program (BCB).

Bu.edu/bioinformatics/

Interdisciplinary PhD and Masters Programs that include an internship in the local industry companies. In conjunction with the NE masters program.

Bioinformatics.ubc.ca

A computational biology research centre covering many areas of genomics, proteomics, computer science and statistics. Research, training, news and events, resources and support, director's message, faculty and personnel.

Openhelix.com

Provides onsite training on specific bioinformatics databases and tools. Also offers bioinformatic software testing and research consulting services.

Igb.uci.edu

Specializing in making publicly available software and database services for computational biology.

Bioinformatics.pe.kr

Maintained by Dr. Seyeon Weon, Korea providing information on courses, a database archive, software archive and online resources.

Groups.yahoo.com/group/bimatics/

Bioinformatics group for students interested and/or working in the bioinformatics/computationalbiology fields. Offers opportunities to exchanging information and sharing ideas.

Ncbi.nlm.nih.gov/books/NBK22183/

Information about several medically important genes and related diseases. Illustrates the use of bioinformatics in their study.

Bioinfo.mbb.yale.edu/mbb452a/2003/

Bioinformatics course at Yale University. All course slides are available online.

Cs.iastate.edu/~honavar/comp-bio-courses.html

Listing of computational molecular biology course pages that have extensive online course materials.

Bioinf.manchester.ac.uk/dbbrowser/bioactivity/prefacefrm.html

A web-based tutorial associated with "Introduction to bioinformatics" published by Addison Wesley Longman.

Northeastern.edu/bioinformatics/

From the Biology department and in cooperation with Boston University. Emphasis on the ability to integrate knowledge from biological, computational, and mathematical disciplines.

Biocomp.unibo.it/lsbioinfo/

A two year, international master's programme in bioinformatics at the Universita di Bologna, Italy.

Cs.helsinki.fi/bioinformatiikka/mbi/programme.html

A two year Masters Degree Programme in Bioinformatics (MBI) offered by the University of Helsinki and Helsinki University of Technology, Finland.

Ornl.gov/sci/techresources/Human_Genome/education/education.shtml

A resource for introductory information on the Human Genome Project.

His.se/bioinformatics

A one-year, international master's programme in bioinformatics at the University of Skovde, Sweden.

Members.tripod.com/C.elegans/

Resources in biochemical, molecular, cellular, system, and organism biology, including over 25,000 indexed links, accumulated since 2000, from topic menus or from search interface.

Bioinformatics.org/faq/#contents

Summary of basics of bioinformatics for the intelligent newcomer.

Jiscmail.ac.uk/archives/bioinformatics.html

Forum featuring various aspects, events and developments in the bioinformatics field.

Biinoida.blogspot.com

Blog focusing on bioinformatics, biotechnology, pharma regulatory affairs, IPR and clinical trials.

Colorbasepair.com/bioinformatics_courses_tutorials.html

A list of on-line course materials and tutorials for bioinformatics and computational biology.

Geospiza.com/education/

Instructional materials for teaching bioinformatics. These include animated tutorials on topicssuch as BLAST, finding mutations in a protein, and graphing with MS-Excel.

Bioinformatics.fi

An international, two-year Master's programme jointly managed by the University of Tampere and the University of Turku, Finland.

Perlsource.net

Provides online courses in Perl programming for bioinformatic tools.

Bioinformatician are not anti-social; We are just genome friendly.

Bioinformatician would love to change the biological world, but they won't give us the genetic code :P

If at first you don't succeed; call it version 1.0

The glass is neither half-full nor half-empty: it's actually have several genomes.

I'm BioGeek.

Fedup with LIPS, try God script.

Idiot, Go ahead, make my data!

Thank god, my genome just compiled.

Error message: "Out of space on genome drive:"

Shut up mobile elements, or i'll flush you out.

Never underestimate the internet bandwidth, u gotta incomplete.

Applied fuzzy logic to understand God's logic?

Warning! Overflow, delete chromosome !

Be nice to the BioGeek, for all you know they might be the next curator!

Beware of computational biologist they screw genes and protein.

Warning! Your genome is full of garbage, delete it !

Bad or missing mouse genome. Spank the cat? (Y/N)

Genome make very fast, very accurate mistakes.

Let's BLAST it.

Some genome never has transposons. It just develops random features.

Go watch CINEMA and have BLAST.