Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^2: Words in Words

by LanX (Saint)
on Oct 01, 2011 at 09:44 UTC ( [id://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
Domain Nodelet?
Node Status?
node history
Node Type: note [id://929021]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others admiring the Monastery: (3)
As of 2024-03-29 14:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found