Greedy String Tiling with Karp-Rabin matching (RKR-GST, Wise 1993) as JPlag's GreedyStringTiling.compareOrdered
(https://github.com/jplag/JPlag, without base code and match merging): in each round, the longest unmarked common
substrings of at least minimumMatchLength tokens become tiles and are marked, until only matches of the minimum length remain.
Pass the shorter sequence as left, as JPlag does.
Greedy String Tiling with Karp-Rabin matching (RKR-GST, Wise 1993) as JPlag's
GreedyStringTiling.compareOrdered(https://github.com/jplag/JPlag, without base code and match merging): in each round, the longest unmarked common substrings of at leastminimumMatchLengthtokens become tiles and are marked, until only matches of the minimum length remain. Pass the shorter sequence asleft, as JPlag does.