Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^7: Fast common substring matching

by GrandFather (Cardinal)
on Nov 29, 2005 at 22:56 UTC ( #512793=note: print w/ replies, xml ) Need Help??


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

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


Comment on Re^7: Fast common substring matching

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (4)
As of 2014-10-31 04:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (214 votes), past polls