Given a set of strings compute the longest common substring using suffix trees. - View it on GitHub