Re: Words in Words

[thezip]

in reply to Words in Words

While I'm not an expert on tries, there seems to be a lot of potential there for your stated problem. Give it a look.

Here's a trie implementation in Perl.

[LanX]

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.