http://www.bccs.uni.no/units/cbu/research/rehmsmeier/

The project involves identification and characterization of transcription factors (TFs) from the Arabidopsis shoot apical meristem stem cell niche using genomic approaches and construction of a gene regulatory network for the identified TFs.

Positions: 1

Duration: 1 year but extendable up to three years based on performance and availability of funds.

Emoluments: As per DST rules.

Essential Qualifications: M.Sc. in any branch of life sciences with excellent academic record with CSIR-UGC NET or DBT-JRF. Candidate having previous work experience in the area of bioinformatics, molecular biology and genetics is preferred, but not required.

How to Apply: Applicants are requested to send a cover letter outlining previous research experiences and reasons for joining this position. Please send your complete bio-data including the cover letter as PDF attachment by email to Dr. Ram Yadav at ryadav@iisermohali.ac.in

Last date of submission is 17.00 IST, August 10, 2013.

Advertisement: www.iisermohali.ac.in/project_openings.html#29

Candidate Requirements:
A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered.

To Apply
To apply, please send your updated CV and cover letter to Dr. Rohit Gupta (rohit@strandls.com).

Source: http://www.strandls.com/application-scientist

Genomics in India
www.ganitlabs.in
www.sandor.co.in
www.igib.res.in
www.genotypic.co.in
www.ocimumbio.com
www.abcgenomics.com
www.xcelrisgenomics.com
www.ayugen.com
www.geneombiotech.com

All applications sent before 2nd of February 2015.

http://www.mind-project.eu/career

The genomics platform uses cancer genome sequencing and other high-throughput techniques to identify genes critical to the development of cancer and anomalies in the genomic profile of the tumours.

For more info visit : http://oicr.on.ca/

The closing date for application will be 26 June 2015.

More @ http://www.au-kbc.org/

• 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.

Analysis of regulatory sequences (RSAT project)
Classification and analysis of mobile genetic elements (ACLAME project).
Analysis of molecular interaction networks (NeAT project)
Inference of metabolic pathways from genomic and post-genomic data
(metabolic pathfinding, see also metabolic pathfinding in NeAT)
Critical assesment of protein interactions (CAPRI)

Lab Page http://www.bigre.ulb.ac.be/