Perhaps a more efficient suffixtree library could work faster on bigger inputs?
Yes definitely.
By the way, I regenerated the solutions with your implementation, and it yields better results for all solutions expect one…
Neat!
Unfortunately, most of the literature’s algorithms on this topic are very array-centric and procedural.
I don’t see this as a problem, we have arrays in Haskell (:
The suffix tree seems to stand out as a structure that carries over well to functional programming.
I would disagree, there isn’t a lot that is functional about it. Except that it’s a tree of course, and we love trees.