Sha256: f05f94878cd30ab3debdd3a33da64fdeaa283d3109fb7656598225b5bca0bf8c
Contents?: true
Size: 1.42 KB
Versions: 68
Compression:
Stored size: 1.42 KB
Contents
# 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... ## Elm Installation Refer to the [Exercism help page](http://exercism.io/languages/elm) for Elm installation and learning resources. ## Writing the Code The first time you start an exercise, you'll need to ensure you have the appropriate dependencies installed. ```bash $ elm-package install --yes ``` Execute the tests with: ```bash $ elm-test ``` Automatically run tests again when you save changes: ```bash $ elm-test --watch ``` As you work your way through the test suite, be sure to remove the `skip <|` calls from each test until you get them all passing! ## 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.
Version data entries
68 entries across 68 versions & 1 rubygems