【发布时间】:2016-02-04 21:07:13
【问题描述】:
以下是我的 DNA 字符串相邻问题的代码:
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[0]]
if (d < len(pattern)):
r2 = neighbors(pattern[1:], d)
r += [pattern[0] + r3 for r3 in r2]
return r
def neighbors2(pattern, d):
return ([neighbors(pattern, d2) for d2 in range(d + 1)], [])
print (neighbors2("ACG", 1))
输出如下:
([['ACG'], ['CCG', 'GCG', 'TCG', 'AAG', 'AGG', 'ATG', 'ACA', 'ACC', 'ACT']], [])
我怎样才能添加一些代码并改变输出看起来像这种模式:
CCG
TCG
GCG
AAG
ATG
AGG
ACA
ACC
ACT
ACG
【问题讨论】:
-
您的输出顺序与打印顺序不同。(最后打印的 ACG,有一个额外的 AGG、TCG 和 GCG 交换)是否有任何变化或只是拼写错误?