Intermediate Exercism • elixir

Hamming

Challenge Overview

Calculate the Hamming distance between two DNA strands.

Introduction

Your body is made up of cells that contain DNA. Those cells regularly wear out and need replacing, which they achieve by dividing into daughter cells. In fact, the average human body experiences about 10 quadrillion cell divisions in a lifetime!

When cells divide, their DNA replicates too. Sometimes during this process mistakes happen and single pieces of DNA get encoded with the incorrect information. If we compare two strands of DNA and count the differences between them, we can see how many mistakes occurred. This is known as the “Hamming distance”.

The Hamming distance is useful in many areas of science, not just biology, so it’s a nice phrase to be familiar with :)

Instructions

Calculate the Hamming distance between two DNA strands.

We read DNA using the letters C, A, G and T. Two strands might look like this:

GAGCCTACTAACGGGAT
CATCGTAATGACGGCCT
^ ^ ^  ^ ^    ^^

They have 7 differences, and therefore the Hamming distance is 7.

Implementation notes

The Hamming distance is only defined for sequences of equal length, so an attempt to calculate it between sequences of different lengths should not work.

Source: Exercism elixir/hamming

💡 View Solution

defmodule Hamming do
  def hamming_distance(strand1, strand2) when byte_size(strand1) != byte_size(strand2),
    do: {:error, "strands must be of equal length"}
  def hamming_distance(strand1, strand2) do
    count =
      Enum.zip(String.graphemes(strand1), String.graphemes(strand2))
      |> Enum.count(fn {a, b} -> a != b end)
    {:ok, count}
  end
end