-- Ted Zlatanov <[EMAIL PROTECTED]> on 03/14/02 10:38:29 -0500
> I remember a lengthy LCS discussion, and the solutions for the most
> part used the regex engine. I also looked on CPAN, but couldn't find
> a canonical LCS module.
>
> 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. Then you rotate the shorter
> data string by one, and repeat the test. Repeat for the number of
> bits in the shorter data string. I want to do it, but just wanted to
> check if it had come up before on FWP.
>
> There are even better algorithms to do this.
Simplest one I know of uses Q::S w/ a single statement
(gets the whole thing done in parallel universes in
constant time too).
Check Damian's BioInformatics conference talk on Q::S for
the code.
--
Steven Lembark 2930 W. Palmer
Workhorse Computing Chicago, IL 60647
+1 800 762 1582
