Long common substring with suffix tree problem

Hi, folks. I'm trying to implement a generalized suffix tree to solve the longest common substring problem. I'm using the McCreight's algorithm to build the suffix tree. What I'm concerning is how would this algorithm be affected if one of the strings imported is much much longer than others. Will the time and space efficiency be affected? If so, how am I supposed to change the algorithm to make it work better? Thanks very much

Hi rosoo!

I saw that you are interested in generalized suffix trees (GSTs) and I'd like to ask you if you have any implementation of GSTs in mind!

Thank you in advance.