https://function.princeton.edu/

Address of the bookmark: https://breedbase.org/

Furthermore, it displays the tree in a mobile phone (iPhone and Android) if the input file size is small.  CITATION: Subramanian, S., Ramasamy, U. and Chen, D. (2019).  VCF2PopTree: a client-side software to construct population phylogeny from genome-wide SNPs.  Peer J. x:yy.

Address of the bookmark: https://github.com/sansubs/vcf2pop

Address of the bookmark: https://sourceforge.net/projects/bio-rainbow/files/

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

Address of the bookmark: https://github.com/clwgg/nQuireunder

(A) Senior Research Fellow (One Post): Emoluments as per DST/DBT norms.

Candidates having M.Sc. degree (with minimum of 55% marks) or equivalent in Life Sciences/Biotechnology/Bioinformatics/ Molecular Biology or any other related field with minimum of two years of post M.Sc. research experience are eligible to apply. The candidate having computer skill (Linux, Perl, Java, MySQL) and/or experience in advanced molecular biology, next generation sequencing data analysis and molecular markers analysis will be preferred.

The position is completely on temporary basis and co-terminus with the project. The initial appointment will be for one year, which can be curtailed/extended on the basis of assessment of the candidate’s performance and discretion of the Competent Authority. NIPGR reserves the right to select the candidate against the above posts depending upon the qualifications and experience of the candidates. Reservation of posts shall be as per Govt. of India norms.

Eligible candidates may apply by sending hard copy of completed application in the given format with a cover letter showing interest and attested copies of the certificates and proof of research experience. The applications should reach at the address given below within 15 days from the date of the advertisement. The subject line on envelope must be superscribed by “Application for the Post of SRF in DST - AISRF project”.

Note: ONLY hard copy of the application in the given format will be accepted.

Last date April 03, 2014

Dr. Mukesh Jain
Staff Scientist
National Institute of Plant Genome Research
Aruna Asaf Ali Marg, P.O. Box NO. 10531,
New Delhi - 110067

Advertisement: http://www.nipgr.res.in/careers/vacancies_latest.php#

GEvol is unique as it will use, for the first time, a large taxonomic group to focus on one goal: to characterise the dynamics and mechanisms of genomic innovations underlying novel traits using comparative evolutionary genomics (and related data).
Thus, projects participating in GEvol we will ask fundamental evolutionary questions such as:
1. At what level is evolution repeatable?
2. How does genomic plasticity interfere with phenotypic plasticity during evolution?
3. How do inter- and intra-specific interactions influence genomic architectures?
4. How predictable is phenotypic variation given some knowledge about the dynamics and mechanisms of underlying genome evolution?

Address of the bookmark: https://g-evol.uni-muenster.de/open-positions/

Address of the bookmark: https://sourceforge.net/projects/taxoblast/files/

Detail paper at https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-017-3927-8

Address of the bookmark: https://github.com/VicugnaPacos/ALPACA