On Thu, 14 Mar 2002 10:38:29 -0500, Ted Zlatanov wrote: >Has anyone developed an implementation of the well-known bitstring >algorithm? Basically you convert your data strings to bitstrings, AND >the two, and look for the longest match.
Maybe it's just me, but that doesn't feel right. If you AND two
bitstrings, you loose information.
I'd rather look into XOR, and look for the longest string of null bytes
in the result.
--
Bart.
