http://qs321.pair.com?node_id=512790


in reply to Re^5: Fast common substring matching
in thread Fast common substring matching

I had thought it was just some sort of cryptic progress meter. :-)

LOL - I know what you mean.

I'm still going over your original code to see how you did what you did -- trying to learn some perl :-)

I'll give the new code a try. I also see that the minimum length in your code doesn't have to be a power of 2. This should allow me to analyze a limit boundary that appears to be present in my data. Grandfather's code allowed me to come up with what I feel is a pretty good estimate for the value of the limit, but this should allow a closer examination of the limit.

Mike

Replies are listed 'Best First'.
Re^7: Fast common substring matching
by GrandFather (Saint) on Nov 29, 2005 at 22:56 UTC

    Actually as far as I can remember my code doesn't require a power of 2 for the minimum size either. It may have been more important in earlier versions than in the current version.

    Somewhere on my todo list is an item to look at Roy's code, but I've not got down to that item on the list yet. :)

    DWIM is Perl's answer to Gödel
[reply]
Re^7: Fast common substring matching
by bioMan (Beadle) on Nov 30, 2005 at 19:33 UTC

    Thanks for the clarification. For some reason I got it in my head that the minimum length of the substring had to be a power of 2. That idea must have come from someone else's algorithm for the longest common string search.

    Nontheless, your script has been very useful to me.

    Mike

[reply]

In Section Cool Uses for Perl