"Computational Methods for the Analysis of the Diversity and Dynamics of Genomes"

has currently open positions for graduate students, to study at Simon Fraser University (Vancouver, Canada) and
Bielefeld University (Germany), starting in the fall 2014.

This international graduate program is a close cooperation of:

Bielefeld University, Germany: Graduate progam "DiDy"
Simon Fraser University (SFU), Vancouver, Canada: Graduate program "MADD-Gen"

The available positions include six PhD positions at Bielefeld University, as well as PhD and MSc positions at SFU.

Application deadline: December 31st, 2013
Webpage: http://wiki.techfak.uni-bielefeld.de/didy/Announcement

Foreign nationals intending to have certification are eligible to appear for BINC examination.
Minimum qualification includes a degree from a recognized university/institute in the areas listed in FAQ.
Formal training in the area of Bioinformatics is not a prerequisite.
Note that the foreign students will only be certified by DBT and are not eligible for the cash award as well as junior research fellowship.

Address of the bookmark: http://binc.scisjnu.ernet.in/

Apply to Genotypic Technology if you are a PhD in Life Sciences/ Molecular Biology/ Biotechnology/ Human Genetics/ Bioinformatics with minimum 4-5 years post doctoral experience as well as publications in peer reviewed journals.

Source: http://www.genotypic.co.in/Careers/2/Current-Openings.aspx

• 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 Taverna suite is written in Java and includes the Taverna Engine(used for enacting workflows) that powers both the Taverna Workbench(the desktop client application) and the Taverna Server (which allows remote execution of workflows). Taverna is also available as a Command Line Tool for a quick execution of workflows from a terminal.

Address of the bookmark: http://www.taverna.org.uk/

Gargi believes in its mission statement that every student who passes through the portals of the college emerges as a wholly developed individual symbolizing the spirit of enterprise and inquiry that characterizes Gargi.

Bioinformatics Infrastructure Facility (BIF), Gargi College, University of Delhi invites candidates for filling up the following purely temporary positions sponsored by DBT, New Delhi.

1. Name of the post: Traineeship
Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics.
Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development.

2. Name of the post: Research Associate
Essential Qualification: PhD in Bioinformatics/Biological Sciences/Computer Science or allied sciences with proven experience in bioinformatics.

3. Name of the post: Studentship
Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics.

How to apply:
Interested candidates are required to appear for the walk in interview on 29th Aug, 2013 at 10.00 AM in Principal’s Office, Gargi College, Sirifort Road, N. Delhi-110049, with their CVs, original documents and a set of Photostat copies of all original documents.

http://www.du.ac.in/fileadmin/DU/students/Pdf/du/advt/2013/16082013_Gargi_RAplus2_Advt.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.