Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

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

Comment on Re^2: Words in Words

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (10)
As of 2015-12-02 03:47 GMT
Find Nodes?
    Voting Booth?

    My keyboard shows this many letters:

    Results (33 votes), past polls