008 - Counting Point Mutations

Given two strings s and t of equal length, the Hamming distance between s and t, denoted \(d_H(s,t)\), is the number of corresponding symbols that differ in s and t.

This is a concrete example of the Counting Point Mutations problem on the Rosalind bioinformatics problems website.

The downloadable data for the human insulin gene (in particular the gene.fna “FASTA” file) contains two different reference genome assemblies of the same length. Calculate the Hamming Distance between them.