Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
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.


Comment on Re: Generalized Suffix Tree in Perl

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (11)
As of 2015-07-02 11:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (34 votes), past polls