Instances of the longest common subsequence problem in which the number of matches is small compared to the product of the lengths of the input strings.