/// <summary>Initializes a new instance of the problem solver for the longest common substring problem.</summary>
/// <param name="gsa">Generalized suffix array. It is neccessary that this was constructed with individual words.</param>
public LongestCommonSubstringBaseA(GeneralizedSuffixArray gsa)
: base(gsa)
{
}
/// <summary>Initializes a new instance of the problem solver for the repeated longest common substring problem.</summary>
/// <param name="gsa">Generalized suffix array. It is neccessary that this was constructed with individual words.</param>
public LongestCommonRepeatL(GeneralizedSuffixArray gsa)
: base(gsa)
{
}
/// <summary>Initializes a new instance of the problem solver for the repeated longest common substring problem.</summary>
/// <param name="gsa">Generalized suffix array. It is neccessary that this was constructed with individual words.</param>
/// <param name="x_repeats">Number of repeats in each of the words.</param>
public LongestCommonRepeatL(GeneralizedSuffixArray gsa, int x_repeats)
: base(gsa)
{
_x_repeats = x_repeats;
}
/// <summary>Initializes a new instance of the problem solver for the longest common substring problem.</summary>
/// <param name="gsa">Generalized suffix array. It is neccessary that this was constructed with individual words.</param>
public LongestCommonSubstringBase(GeneralizedSuffixArray gsa)
{
_numberOfWords = gsa.NumberOfWords;
_wordIndices = gsa.WordIndices;
_wordStartPositions = gsa.WordStartPositions;
_suffixArray = gsa.SuffixArray;
_LCP = gsa.LCPArray;
_LCPS = gsa.LCPSArray;
_maximumLcp = gsa.MaximumLcp;
}
