Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Generalized Suffix Tree in Perl

by tall_man (Parson)
on Nov 23, 2005 at 19:37 UTC ( #511220=note: print w/replies, xml ) Need Help??


in reply to Generalized Suffix Tree in Perl

The following might be helpful: Re: finding longest common substring

It constructs a suffix tree in order to find the largest common substring of multiple strings.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://511220]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (2)
As of 2017-04-29 08:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (531 votes). Check out past polls.