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

Walk-in-Interview

Walk-in-interview will be held on February 11, 2014 at 10:00 A.M. at IASRI, New Delhi for a project “Whole Genome Sequencing and Development of Allied Genomics Resources in Two Commercially Important Fish-Labeo rohita and Clarias batrachus” funded by Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi for the following posts. The appointment will be on contractual basis upto September, 2016 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.

Senior Research Fellow Two

Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application/ Biotechnology or equivalent with 1st Division

 Knowledge of Statistical Analysis /Bioinformatics tools/computer programming for computational genomics.

Emoluments for Research Associate: Consolidated Rs: 16000/- per month + 30% HRA (1st Two years) and Rs: 18000/- per month + 30% HRA (3rd Year)

Age Limit: Age should be not more than 35 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates as on date of interview).
Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph. Original certificates/ Degrees are needed to be produced at the time of interview. No T.A. /D.A. will be paid for appearing in the interview.

Advertisement: http://www.iasri.res.in/employment/2014/srf_cabin.pdf

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/

Candidates having the below mentioned qualifications may appear for Walk in Interview at ICPO on 5th Feb 2014 between 10.00 AM and 12.00 PM under the NIF project entitled "Prediction of drug tragets of chemical constituents present within non-codified medicinal plants" under Dr Subhash M.Agarwal, Scientist C

Position : JRF
No of Post : One
Pay : Rs 12000/- + 30% HRA

Desired Profile : M.Sc in Bioinformatics with good academic record. Candidate with experience in database development and scripting would be preferred
Age Limit : Below 28 years
Period : 2 months

Interested candidates may send their applications with bio-data by email (smagarwal@gmail.com) or post addressed to Dr Subhash M Agarwal, Scientist C, Bioinformatics Division, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector 39, Noida-201301 so as to reach latest by 04.02.14

Deadline : 04.02.14

http://icmr.nic.in/icmrnews/icpo_jrf.pdf

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

* Analysis of Gene Expression Pattern Images: high-performance image analysis and mining for different model organisms, such as fruitfly, C. elegans, and mouse;
* Feature/Model Learning: developing algorithms and software

Location :Janelia Farm Research Campus, Howard Hughes Medical Institute, Ashburn, Virginia, USA.

http://research.janelia.org/peng/

This position will have a significant focus on providing analytical support for next generation sequencing data analysis – Exome-sequencing, Targetted sequencing as well as high-throughput genotyping on Illumina platform.

Job location:

Genome Research Chair
King Saud University, Riyadh-11451
KSA

Interested candidate may forward their CV to grcksu@gmail.com

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