zoukankan      html  css  js  c++  java
  • 06 Counting Point Mutations

    Problem

    Figure 2. The Hamming distance between these two strings is 7. Mismatched symbols are colored red.

    Given two strings ss and tt of equal length, the Hamming distance between ss and tt, denoted dH(s,t)dH(s,t), is the number of corresponding symbols that differ in ss and tt. See Figure 2.

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

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

    Sample Dataset

    GAGCCTACTAACGGGAT
    CATCGTAATGACGGCCT
    

    Sample Output

    7

    方法一:
    s = 'GAGCCTACTAACGGGAT'
    t = 'CATCGTAATGACGGCCT'
    count = 0
    for i in xrange(len(s)):
        if s[i] != t[i]:
            count +=1
    print count
    

     方法二:

    ### Counting Point Mutations ###
    fh = open('/Users/DONG/Downloads/rosalind_hamm.txt', 'rt')
    seq = fh.readlines()
           
    a,b = seq[0].strip(),seq[1].strip()    
    hammingDistance = 0
     
    for i in range(len(a)):
        if a[i] != b[i]:
            hammingDistance += 1
             
    print (hammingDistance)
    

      

  • 相关阅读:
    Skimage=scikit-image SciKit 包的模块(转载)
    python day12
    python day11
    python day10
    python day9
    python day8
    python day7
    python day6
    python 第五天
    python 第四天
  • 原文地址:https://www.cnblogs.com/think-and-do/p/7270049.html
Copyright © 2011-2022 走看看