http://www.perlmonks.org?node_id=929021


in reply to Re: Words in Words
in thread Words in Words

yes searching in Suffix_tree is O(1), but constructing those trees implies a overhead.

Since in our case all searched strings are also known in advance, I'm not sure that this is really the fastest approach.

At least the construction process will already identify embedded strings, since they are leaves of the suffix tree.

Cheers Rolf