July 19, 2020, 4:31 a.m. by gulfammushtaq007
chars = "ACGT"
def neighbors(pattern, d): assert(d <= len(pattern))if d == 0: return [pattern] r2 = neighbors(pattern[1:], d-1) r = [c + r3 for r3 in r2 for c in chars if c != pattern] if (d < len(pattern)): r2 = neighbors(pattern[1:], d) r += [pattern + r3 for r3 in r2] return r
An example of an DNA string (whose alphabet contains the symbols A, C, G, and T) is ATGCTTCAGAAAGGTCTTACG.
Given: A DNA string
Return: Four integers corresponding to the number of times that the symbols A, C, G, and T occur in
20 12 17 21