Dailydave mailing list archives
Re: approximate string matching
From: "Mateusz Berezecki" <mateuszb () gmail com>
Date: Fri, 1 Sep 2006 19:06:42 +0200
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
Current thread:
- approximate string matching Mateusz Berezecki (Sep 01)
- Re: approximate string matching Arun Koshy (Sep 01)
- Re: approximate string matching Mateusz Berezecki (Sep 01)
- Re: approximate string matching Tony Carter (Sep 01)
- Re: approximate string matching Martin Roesch (Sep 01)
- Re: approximate string matching Mateusz Berezecki (Sep 01)
- Re: approximate string matching Arun Koshy (Sep 01)