
rosalind road
文章平均质量分 65
baker00
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Transcribing DNA into RNA
Transcribing DNA into RNA第二题也很简单,不过python还是有很多细节要注意。比如string 是不可变数据类型,可见转载17个新手常见Python运行时错误file=open('rosalind_rna.txt','r');seq=file.read();leng=len(seq);for i in range(0,leng): if se原创 2015-07-21 21:16:02 · 472 阅读 · 0 评论 -
Complementing a Strand of DNA
ProblemIn DNA strings, symbols 'A' and 'T' are complements of each other, as are 'C' and 'G'.The reverse complement of a DNA string is the string formed by reversing the symbols of ,原创 2015-07-27 17:06:56 · 688 阅读 · 0 评论 -
Counting DNA Nucleotides
第一题很简单,但是没怎么用过python,一道题中还是学到很多。counting DNA nucleotidedna=open('rosalind_dna.txt','r');这只是一个句柄而已,需要read()或者 readline() 读入文件内容。len(seq)定义dict 还好只有4个碱基,但是以后肯定会需要更方便的定义。d={'A':0,'C':0,'G':0,'T'原创 2015-07-10 10:50:21 · 544 阅读 · 0 评论 -
Computing GC Content
ProblemThe GC-content of a DNA string is given by the percentage of symbols in the string that are 'C' or 'G'. For example, the GC-content of "AGCTATAG" is 37.5%. Note that the reverse complem原创 2015-08-08 00:32:47 · 1577 阅读 · 0 评论 -
Rabbits and Recurrence Relations
ProblemA sequence is an ordered collection of objects (usually numbers), which are allowed to repeat. Sequences can be finite or infinite. Two examples are the finite sequence (π,−2√,0,π) and原创 2015-07-29 09:27:59 · 1075 阅读 · 0 评论 -
Counting Point Mutations
ProblemFigure 2. The Hamming distance between these two strings is 7. Mismatched symbols are colored red.Given two strings and of equal length, the Hamming distance between and ,原创 2015-08-19 22:43:19 · 617 阅读 · 0 评论