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
In reply to Re^2: Words in Words
by LanX
in thread Words in Words
by sarchasm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |