Allow less greedy insertion/deletion

[bertsky]

I am not sure whether there even exists a metric for this: if there is a segment where both sequences deviate a lot in their length, then the current algorithm will do as many substitutions to the left as possible and fill up the rest by insertions/deletions. Wouldn't it be fairer if it tried to distribute those more evenly across the segment's symbol mass?