This initial problem is aimed at familiarizing you with Rosalind's task-solving pipeline. To solve it, you merely have to take a given DNA sequence and find its nucleotide counts; this problem is equivalent to “Counting DNA Nucleotides” in the Stronghold.
Of the many tools for DNA sequence analysis, one of the most popular is the Sequence Manipulation Suite. Commonly known as SMS 2, it comprises a collection of programs for generating, formatting, and analyzing short strands of DNA and polypeptides.
One of the simplest SMS 2 programs, called DNA stats
, counts the number of occurrences of each nucleotide in a given strand of DNA. An online interface for DNA stats
can be found here.
Given: A DNA string of length at most 1000 bp.
Return: Four integers (separated by spaces) representing the respective number of times that the symbols 'A', 'C', 'G', and 'T' occur in . Note: You must provide your answer in the format shown in the sample output below.
这个最初的问题旨在使您熟悉Rosalind的任务解决管道。要解决这个问题,您只需要获取一个给定的DNA 序列 并找到其核苷酸计数即可。此问题等同于要塞中的 “计算DNA核苷酸”。
在许多用于DNA序列分析的工具中,最受欢迎的工具之一是 Sequence Manipulation Suite。通常称为SMS 2,它包含用于生成,格式化和分析DNA和多肽短链的程序的集合。
最简单的SMS 2程序之一称为DNA stats
,它计算给定DNA链中每个核苷酸的出现次数。DNA stats
可在此处找到 的在线界面。
返回值:四个整数(用空格分隔)代表符号'A','C','G'和'T'在以下位置出现的次数。。 注意:您必须以下面的示例输出中显示的格式提供答案。
AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC
20 12 17 21