|
|
9 yıl önce | |
|---|---|---|
| .. | ||
| .meta/src/reference/java | 9 yıl önce | |
| src | 9 yıl önce | |
| README.md | 9 yıl önce | |
| build.gradle | 9 yıl önce | |
Given a single stranded DNA string, compute how many times each nucleotide occurs in the string.
The genetic language of every living thing on the planet is DNA. DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides. 4 types exist in DNA and these differ only slightly and can be represented as the following symbols: 'A' for adenine, 'C' for cytosine, 'G' for guanine, and 'T' thymine.
Here is an analogy:
To run the tests:
$ gradle test
For more detailed info about the Java track see the help page.
The Calculating DNA Nucleotides_problem at Rosalind http://rosalind.info/problems/dna/
It's possible to submit an incomplete solution so you can see how others have completed the exercise.