擅长:python、mysql、java
<pre><code>def ApproximatePatternMatching(Pattern, Text, d):
positions = []
for i in range(len(Text)-len(Pattern)+1):
x = Text[i:i+len(Pattern)+1]
if x != Pattern:
y = HammingDistance(Pattern,x)
if y <= d:
positions.append(i)
return positions
def HammingDistance(p, q):
count = 0
for i in range(len(p)):
x = p[i]
y = q[i]
if x != y:
count = count + 1
return count
</code></pre>