Population genetics: A concise guide. John Gillespie.The Johns Hopkins University Press (1997)•

Population genetics. J. S. Gale. Wiley (1980)•

Evolutionary genetics. John Maynard-Smith. Oxford University Press (1998)•

The growth of biological thought. Ernst Mayr. Harvard University Press (1985)•

Guns, germs and steel. Jared Diamond. W. W. Norton (2007)•

Evolutionary theory: Mathematical and conceptual foundations. Sean Rice. Oxford University Press (2004)

Few places in Europe where good (and @some places no tution fees) master bioinformatics courses and recommended are:

KU Leuven, Belgium

http://onderwijsaanbod.kuleuven.be/opleidingen/e/CQ_50269018.htm

ETH, Zurich

http://www.cbb.ethz.ch/

University of Copenhagen, Denmark

http://studies.ku.dk/masters/bioinformatics/

University of Helsinki, Finland

http://www.cs.helsinki.fi/en/mbi/

Stockholm University, Sweden

http://www.sbc.su.se/masters/

Universities in Netherlands

http://www.nbic.nl/education/msc-programmes/

TUM , Munich Germany

http://www.mastersportal.eu/studies/865/bioinformatics.html

University of Bergen, Norway

http://www.uib.no/en/studieprogram/MAMN-INF/BI/plan

Goethe-University in Frankfurt am Main

http://www.uni-frankfurt.de/58444439/mabi

Other links:

http://www.masterstudies.com/Masters-Degree/Bioinformatics/Europe/

https://studyinsweden.se/programmes/?query=bioinformatics&period=ht-2016&level=ma&subject=natural-science&university=#search

Date : June 10-13

Organizers: The Society for Bioinformatics in Northern European countries (SocBiN) and the Norwegian Bioinformatics Platform / ELIXIR.NO

Venue: Department of Informatics, University of Oslo, Norway

Topics:
Tools and technologies for integrative bioinformatics
Metagenomics
Comparative genomics and phylogeny
Post-ENCODE bioinformatics
Gene regulation
Cancer genomes
Marine genomics

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

Please add ur links/bookmarks in comment section.

Address of the bookmark: http://physicsdatabase.com/free-math-books/

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/

Address of the bookmark: http://bioinformatics.oxfordjournals.org/content/23/14/1713.full

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