Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^3: finding longest common substring

by thospel (Hermit)
on Dec 03, 2005 at 17:36 UTC ( #513831=note: print w/replies, xml ) Need Help??


in reply to Re^2: finding longest common substring
in thread finding longest common substring

No, it's not a generalized suffix tree. What I implemented here is basically the suffixtree of the concatenation of the strings, which has the same sort of space and time complexity for operations as a generalized suffix tree.

Note that I don't expect that a pure perl version of suffix trees will be very usable for huge strings since the memory overhead of the datastructures will just be too much. This stuff needs an XS module.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (2)
As of 2020-12-03 08:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How often do you use taint mode?





    Results (53 votes). Check out past polls.

    Notices?