Key points are not available for this paper at this time.
A problem extension of the longest common substring (LCS) between two texts is the enumeration of all LCSs given a minimum length
Prosperi et al. (Mon,) studied this question.