|
Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com |
Re: [Dailydave] approximate string matching
From: Mateusz Berezecki (mateuszb
gmail.com)
Date: Fri Sep 01 2006 - 12:06:42 CDT
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Hello Marty,
On 9/1/06, Martin Roesch <roesch
sourcefire.com> wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> Have you taken a look at Bloom Filters? I'm not sure what your exact
> requirements are but Bloom Filters are fast and do probabilistic
> pattern matching. Check out:
>
> http://en.wikipedia.org/wiki/Bloom_filter
> http://www.arl.wustl.edu/~sarang/analysis.pdf
>
> They're easy to implement and fast, so maybe that will work for you.
> Hope that helps!
This looks like a good candidate for potential solution!
Thanks, I'll test this one for sure.
Mateusz
_______________________________________________
Dailydave mailing list
Dailydave
lists.immunitysec.com
http://lists.immunitysec.com/mailman/listinfo/dailydave
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]