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

http://www.isb-sib.ch/education/training-courses.html

Canadian bioinformatics also organises various bioinformatics and sequencing courses:

http://bioinformatics.ca/workshops

In addition to above two, EMBI Europe, EMBO Europe, Cold Spring Harbour USA, Wellcome Trust UK and NOVA Europe also organise bioinformatics and sequencing courses annually:

http://www.embl.de/training/events/index.php?p_outstation=ALL

http://www.embo.org/funding-awards/courses-workshops

http://meetings.cshl.edu/courses.html

http://www.wellcome.ac.uk/Education-resources/Courses-and-conferences/Advanced-Courses-and-Scientific-Conferences/Advanced-Courses/index.htm

http://www.nova-university.org/pagetop.cfm?MenySidorTop_id=2&open=7

PNAS papers:
http://www.pnas.org/search?author1=Janet+Kelso&sortspec=date&submit=Submit

Jobs:
http://www.eva.mpg.de/genetics/bioinformatics/jobs.html

Contact:
Kelso Group
Department of Evolutionary Genetics
Max Planck Institute for Evolutionary Anthropology
Deutscher Platz 6
04103 Leipzig
Germany
Email: kelso@eva.mpg.de

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

Dated : 22 Nov 2013 -23 Nov 2013

http://www.ngsasia-congress.com/

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/

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