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

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/

As these positions are funded by the South African National Research Foundation (NRF) priority will be given to South African citizens and permanent residents however exceptional applicants who do not fulfil these criteria may be considered.

Applications including a CV outlining your experience together with a cover letter detailing why you are a suitable candidate should be sent to simon_at_sanbi.ac.za by 30th September 2013.

More @ http://www.sanbi.ac.za/hiv-phd-and-msc-research-positions/

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

Models and software for predicting who is at risk of carrying genetic variants that confer susceptibility to cancer. Application to breast, ovarian, colorectal, pancreatic and skin cancer.

Statistical methods for the analysis of high throughput genomic data: analysis of cancer genome sequencing projects; integration of genomic information across technologies; cross-study validation of genomics results.

Statistical methods for comparative effectiveness research: comprehensive models for lifetime history of chronic disease outcomes; Bayesian meta-analysis; Bayesian causal inference; decision analysis.

Bayesian modeling and computation: multilevel models; decision theoretic approaches to inference; sequential experimental design and their application to adaptive and multistage studies in clinical and epidemiological research.

http://bcb.dfci.harvard.edu/~gp/index.html

http://scholar.google.com/citations?user=OlpYP3UAAAAJ&hl=en

Understanding DNA-protein interactions, genome engineering
Computational Genomics and Bioinformatics
Secondary metabolite biosynthesis, metabolic engineering

Ongoing Projects:

"Betraying the parasite’s redox system: Studies on spermidine synthase of Leishmania donovani "

"Towards modifying nature's DNA-recognition system"

"Yield enhancement strategies for production of therapeutic compounds by cell and tissue cultures of Tinospora cordifolia (willd.) Miers ex Hook. F. & Thoms"

"Program support for Computational Genomics"

More at http://web.iitd.ac.in/~sundar/

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

The group is both computational and experimental.

We ask biological questions to large datasets made using novel genomics techniques, with the help of computers. One of the strengths in the group are the many connections to high-profile experimental laboratories which supply data to be analyzed.

Lab webpage @ http://people.binf.ku.dk/albin/Sandelin_group_at_the_Bioinformatic_Centre/The_Sandelin_group.html