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

Re: finding strings

by davido (Archbishop)
on Dec 09, 2012 at 17:43 UTC ( #1007993=note: print w/ replies, xml ) Need Help??

in reply to finding strings

I don't have time to work through it at the moment, but I think you'll be more successful using a Suffix Tree. There are a couple of CPAN modules: Tree::Suffix, and SuffixTree. The latter is written in C and bound to Perl via SWIG. It's an old module, but might be useful.


Comment on Re: finding strings
Replies are listed 'Best First'.
Re^2: finding strings
by CountZero (Bishop) on Dec 09, 2012 at 18:58 UTC
    Perhaps, but these "programming challenge" sites have a problem with using non core-modules. :(


    A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

    My blog: Imperial Deltronics

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (8)
As of 2015-12-01 11:56 GMT
Find Nodes?
    Voting Booth?

    My keyboard shows this many letters:

    Results (7 votes), past polls