26 lines
1.0 KiB
Markdown
26 lines
1.0 KiB
Markdown
|
# Nucleotide Count
|
||
|
|
||
|
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:
|
||
|
- twigs are to birds nests as
|
||
|
- nucleotides are to DNA as
|
||
|
- legos are to lego houses as
|
||
|
- words are to sentences as...
|
||
|
|
||
|
## Hints
|
||
|
This exercise requires the use of a Dictionary. For more information see
|
||
|
[this page.](https://msdn.microsoft.com/en-us/library/s4ys34ea(v=vs.110).aspx)
|
||
|
|
||
|
|
||
|
## Source
|
||
|
|
||
|
The Calculating DNA Nucleotides_problem at Rosalind [http://rosalind.info/problems/dna/](http://rosalind.info/problems/dna/)
|
||
|
|
||
|
## Submitting Incomplete Solutions
|
||
|
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
|