Re: 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.

Dave

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. :( CountZero 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	[reply]

Replies are listed 'Best First'.

Re^2: finding strings
by CountZero (Bishop) on Dec 09, 2012 at 18:58 UTC

CountZero

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

[reply]