The original thread I referenced was for longest common subsequence. I still have yet to find an implementation for finding the longest common subsequences for > 2 strings other than the one I posted. I adapted it for common substrings to show it was possible. I would definitely use and recommend
now that I know about it. I mentioned my home grown implementation in this thread in case the XS version of the module
was using was also broken. Thanks!