Mendel's First Law (ID: IPRB)

Problem

給定同型顯性合子、異型合子、同型隱性合子的數量,求隨機配對後子代呈現顯性表徵的機率

Given: Three positive integers k, m, and n, representing a population containing k+m+n organisms: k individuals are homozygous dominant for a factor, m are heterozygous, and n are homozygous recessive.

Return: The probability that two randomly selected mating organisms will produce an individual possessing a dominant allele (and thus displaying the dominant phenotype). Assume that any two organisms can mate.

Counting Point Mutations (ID: HAMM)

Problem

給定兩等長字串 s 和 t,計算兩者的 Hamming distance dH(s,t)

Given: Two DNA strings s and t of equal length (not exceeding 1 kbp).

Return: The Hamming distance dH(s,t).

Computing GC Content (ID: GC)

Problem

給定至多含 10 條 DNA 序列之 fasta 檔,求 GC 比最高者及其 GC 比。

Given: At most 10 DNA strings in FASTA format (of length at most 1 kbp each).

Return: The ID of the string having the highest GC-content, followed by the GC-content of that string. Rosalind allows for a default error of 0.001 in all decimal answers unless otherwise stated; please see the note on absolute error below.

Back to top