Looks like the same solution fits, xor both strings at different positions and count the longest runs of zeros tolerating n non zeros in between, probably with a composed regex.

See ^ in perlop#Bitwise-Or-and-Exclusive-Or