Future projects and goals

Large-scale systematic maps of gene-gene and gene-environment interactions by automated phenotyping, using image analysis, machine learning, sparse model building and causal inference.
DNA-, RNA- and ChIP-Seq and their applications to gene expression regulation: statistical and computational foundations.
Cancer genomics, genomes as biomarkers, cancer phylogeny.
Image analysis for systems biology: measuring the dynamics of cell cycle and of cell migration of individual cells under normal conditions and many different perturbations (RNAi, drugs).

More @ http://www.embl.de/research/units/genome_biology/huber/index.html

http://www.biospectrumindia.com/biospecindia/features/203849/supercomputing-indian-agriculture-fast-track-mode/page/1

Asst. PROF IN BIOINFORMATICS.

QUALIFICATION: AS PER UGC

DESIRABLE: 1 YEAR EXPERIENCE IN ACADEMICS

CONTACT immediately

Prof D.S.Bhatia
Director
9351288070

Last date within 7 days of the publication.

Find more @ http://jnujaipur.ac.in/downloads/AdvtDec2012.jpg

Position Paper Submission Extension: October 9, 2014 
Regular Paper Authors Notification: November 3, 2014 
Position Paper Authors Notification: November 6, 2014 
Regular and Position Paper Camera Ready and Registration: November 17, 2014 

Address of the bookmark: http://www.bioinformatics.biostec.org/

This 2014 HUGO Meeting in Geneva will be a Forum for discussions on innovative approaches, and proposals to tackle the anticipated challenges.

Time : 27 April 2014 - 30 April 2014

For enquiries, please email hugo2014@mci-group.com or visit www.hugo-international.org

More at http://www.hgm2014-geneva.org/

http://www.uib.no/rs/mcb

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

---how genetic variation is distributed within and between individuals,
---determining how this diversity changes over evolutionary time.

Hence, Cox group work at the interface between biology, statistics and computer science to address questions of outstanding biological importance through intrepretation of large genetic datasets.

Profile:
Associate Professor Murray Cox,
Inaugural Rutherford Fellow of the Royal Society of New Zealand, Principal Investigator in the BioProtection Research Center and Associate Investigator in the Allan Wilson Center for Molecular Ecology and Evolution
Email : m.p.cox@massey.ac.nz
Webpage: http://massey.genomicus.com/index.html