Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Words in Words

by LanX (Chancellor)
on Oct 01, 2011 at 09:44 UTC ( #929021=note: print w/ replies, xml ) Need Help??


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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://929021]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (8)
As of 2016-06-24 23:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (322 votes). Check out past polls.