One constructor of the UkkonenSuffixTree class allows for using a range of characters to save space for the three arrays used in each node. Sometimes, however, only a few nonconsecutive characters are used in the text, for example, letters A, C, G, and T in DNA sequences. In this situation, the constructor UkkonenSuffixTree(‘A’,’T’) can be used, which would create three arrays of ‘T’–’A’ + 1 = 20 cells each, although only four cells would be used in each array. Modify the program so that it accepts a set of characters to be used—as with the string “ACGT” in our example—and operates on arrays of the size equal to the number of characters used in the set.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.