Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: An imperfect pattern matcher writer

by tommyw (Hermit)
on Oct 02, 2001 at 18:23 UTC ( [id://116134]=note: print w/replies, xml ) Need Help??


in reply to An imperfect pattern matcher writer

Have you considered String::Approx instead?

Replies are listed 'Best First'.
Re: Re: An imperfect pattern matcher writer
by stefp (Vicar) on Oct 03, 2001 at 02:59 UTC
    First let say, that String::Approx is implemented in C. Has anyone tested how String::Approx stacks up against agrep? I know they are both based on the same algorithm, the Manber-Wu k-differences algorithm shift-add (what a mouthful!). But Jarkko Hietaniemi has written the code without looking at agrep and is not bound by the agrep license (GPL). agrep is used by the glimpse search engine.

    -- stefp

Re: Re: An imperfect pattern matcher writer
by scain (Curate) on Oct 02, 2001 at 18:35 UTC
    tommyw,

    Not a bad idea; I wasn't familar with String::Approx before now either. I am torn now as to whether using it would increase or decrease the level of complexity of the resulting code. Also, since it is not uncommon to be testing thousands of $seqs at a time, I would need to consider execution speed.

    I'll think about implementing it this way and let you know.

    Thanks,
    Scott

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2024-03-28 15:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found