Longest repeated (k times) substring
问题 I know this is a somewhat beaten topic, but I have reached the limit of help I can get from what's already been answered. This is for the Rosalind project problem LREP. I'm trying to find the longest k-peated substring in a string and I've been provided the suffix tree, which is nice. I know that I need to annotate the suffix table with the number of descendant leaves from each node, then find nodes with >=k descendants, and finally find the deepest of those nodes. Theory-wise I'm set. I've