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 | [reply] [Watch: Dir/Any] |
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 | [reply] [Watch: Dir/Any] |