Jonny Nabors fe4b07ca3d Version updates for hamming and scrabble-score (#1332) | 6 лет назад | |
---|---|---|
.. | ||
.meta | 6 лет назад | |
src | 6 лет назад | |
README.md | 7 лет назад | |
build.gradle | 7 лет назад |
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.
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.
This is the first exercise with tests that require you to throw an
Exception
. Exception
s are typically thrown to
indicate that a program has encountered an unexpected input or state.
We use JUnit's ExpectedException
rule throughout the track to verify that the exceptions you throw
are:
You can run all the tests for an exercise by entering
$ gradle test
in your terminal.
The Calculating Point Mutations problem at Rosalind http://rosalind.info/problems/hamm/
It's possible to submit an incomplete solution so you can see how others have completed the exercise.