bitparallel weighted Levenshtein distance

Question

I am using a weighted Levenshtein distance with the following costs:

• insertion: 1
• deletion: 1
• replacement: 2

For the normal impl