Computing the λ-covers of a string

Given a string x of length n and an integer constant λ, the λ-Cover Problem is defined to be the identification of all the sets of λ substrings each of equal length that cover x  . This problem can be solved by a general algorithm in O(n2)O(n2) time for constant alphabet size. We also generalize the λ-Cover Problem, whereby a set of λ   substrings of different lengths are considered, which can be computed using the general algorithm in O(n2)O(n2) time.