Stores the positions of a common substring in a list of words. This corresponds to a certain interval [begin, end] of the suffix array.

Given a text string, the substring starting at position i and until the end of text is called the suffix starting at position i. For a text string with N characters there are N suffixes. This class gives an efficient algorithm to sort all N suffixes lexicographically, and to determine the length of the longest common prefix of each suffix with its lexicographical predecessor. This is generally done in O(N) time.

Converts list of arbitrary objects into an integer array. This is done by creating an integer alphabet, which maps each unique element in the original list(s) to an integer value. The lexicographical order of the elements is maintained, i.e. when a list of elements of ascending order is mapped to an integer list, the integer list is also in ascending order.

Evaluates the longest string, that is i) common to a number of words and ii) is repeated a certain number of times in those strings. The number of repeats the string should occur in each word is given by an array of integers here.

Evaluates the longest string, that is i) common to a number of words and ii) is repeated a certain number of times in those strings. The number of repeats the string should occur in each word is given by an array of integers here.

Evaluates the longest string, that is i) common to a number of words and ii) is repeated a certain number of times in those strings.

Evaluates the longest string, that is i) common to a number of words and ii) is repeated a certain number of times in those strings.

Problem solver for the longest common substring problem, operating in O(N) time (N being the text length), and using an array of linked structures stored in a linear array instead of linked class instances. This code runs slightly faster than LongestCommonSubstringL, and avoids creating a lot of nodes for the linked list, in order to make it easier for the garbage collector.

Base class for problem solvers for the longest common substring problem.

Base class for problem solvers for longest common substring problems using an array of linked structures stored in a linear array instead of linked class instances. This should it make easier for the garbage collector.

Base class for problem solvers for longest common substring problems using a doubly linked list of class instances.

Designates the position of a substring in a list of words.