🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉 # angelikatyborska's solution

## to Hamming in the JavaScript Track

Published at Jul 13 2018 · 0 comments
Instructions
Test suite
Solution

#### Note:

This solution was written on an old version of Exercism. The tests below might not correspond to the solution code, and the exercise may have changed since this code was written.

Calculate the Hamming difference between two DNA strands.

A mutation is simply a mistake that occurs during the creation or copying of a nucleic acid, in particular DNA. Because nucleic acids are vital to cellular functions, mutations tend to cause a ripple effect throughout the cell. Although mutations are technically mistakes, a very rare mutation may equip the cell with a beneficial attribute. In fact, the macro effects of evolution are attributable by the accumulated result of beneficial microscopic mutations over many generations.

The simplest and most common type of nucleic acid mutation is a point mutation, which replaces one base with another at a single nucleotide.

By counting the number of differences between two homologous DNA strands taken from different genomes with a common ancestor, we get a measure of the minimum number of point mutations that could have occurred on the evolutionary path between the two strands.

This is called the 'Hamming distance'.

It is found by comparing two DNA strands and counting how many of the nucleotides are different from their equivalent in the other string.

``````GAGCCTACTAACGGGAT
CATCGTAATGACGGCCT
^ ^ ^  ^ ^    ^^
``````

The Hamming distance between these two DNA strands is 7.

# Implementation notes

The Hamming distance is only defined for sequences of equal length. This means that based on the definition, each language could deal with getting sequences of equal length differently.

## Setup

Go through the setup instructions for JavaScript to install the necessary dependencies:

http://exercism.io/languages/javascript/installation

## Running the test suite

The provided test suite uses Jasmine. You can install it by opening a terminal window and running the following command:

``````npm install -g jasmine
``````

Run the test suite from the exercise directory with:

``````jasmine hamming.spec.js
``````

In many test suites all but the first test have been marked "pending". Once you get a test passing, activate the next one by changing `xit` to `it`.

## Source

The Calculating Point Mutations problem at Rosalind http://rosalind.info/problems/hamm/

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

### hamming.spec.js

``````var Hamming = require('./hamming');

describe('Hamming', function () {
var hamming = new Hamming();

it('no difference between identical strands', function () {
expect(hamming.compute('A', 'A')).toEqual(0);
});

xit('complete hamming distance for single nucleotide strand', function () {
expect(hamming.compute('A', 'G')).toEqual(1);
});

xit('complete hamming distance for small strand', function () {
expect(hamming.compute('AG', 'CT')).toEqual(2);
});

xit('small hamming distance', function () {
expect(hamming.compute('AT', 'CT')).toEqual(1);
});

xit('small hamming distance in longer strand', function () {
expect(hamming.compute('GGACG', 'GGTCG')).toEqual(1);
});

xit('large hamming distance', function () {
expect(hamming.compute('GATACA', 'GCATAA')).toEqual(4);
});

xit('hamming distance in very long strand', function () {
expect(hamming.compute('GGACGGATTCTG', 'AGGACGGATTCT')).toEqual(9);
});

xit('throws error when strands are not equal length', function () {
expect(function () { hamming.compute('GGACGGATTCTG', 'AGGAC'); }).toThrow(
new Error('DNA strands must be of equal length.')
);
});
});``````
``````'use strict';

module.exports.compute = hamming_distance;

function hamming_distance(strand1, strand2) {
if (strand1.length !== strand2.length) {
throw new Error('DNA strands must be of equal length.');
}

var differences = 0;
for (var i = 0; i < strand1.length; i++) {
if (strand1[i] !== strand2[i]) {
differences += 1;
}
}

return differences;
}``````

## Community comments

Find this solution interesting? Ask the author a question to learn more.

### What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

• What compromises have been made?
• Are there new concepts here that you could read more about to improve your understanding?
{"ft_lang_label":"__label__en","ft_lang_prob":0.8363795,"math_prob":0.85195655,"size":4015,"snap":"2021-04-2021-17","text_gpt3_token_len":902,"char_repetition_ratio":0.14609823,"word_repetition_ratio":0.01754386,"special_character_ratio":0.23561645,"punctuation_ratio":0.15864022,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.965873,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-18T18:38:19Z\",\"WARC-Record-ID\":\"<urn:uuid:c29059bb-4fa6-406d-b36f-35e03674b5e5>\",\"Content-Length\":\"18989\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ccb26f0b-08f9-4926-9f51-8f14e7ea40cb>\",\"WARC-Concurrent-To\":\"<urn:uuid:89d8eead-1c77-4733-b461-269360a5b942>\",\"WARC-IP-Address\":\"18.202.93.204\",\"WARC-Target-URI\":\"https://exercism.io/tracks/javascript/exercises/hamming/solutions/3bec9999c73549e4971740fab5313e98\",\"WARC-Payload-Digest\":\"sha1:7QPV7GOOZJ2WGFGAPU3SYAY2Y4BBZOQT\",\"WARC-Block-Digest\":\"sha1:5WOMRNS4HTYPB3LFWIUZ4FYB6TBG3ICQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038507477.62_warc_CC-MAIN-20210418163541-20210418193541-00169.warc.gz\"}"}