

4. Consider the following variant of string alignment: given two strings r, y, and a positive integer L, find all contiguous substrings of length at least L that are aligned (using no-ops = substituting a letter for itself) in some optimal alignment of x and y. Assume the costs of substitution, insertion,
PayPal Gateway not configured
PayPal Gateway not configured