🚀 go-pugleaf

In article <C1F1uu.HI8@world.std.com> jbk@world.std.com (Jeffrey B Kane) writes:
>
>I was wondering if anyone had any good references on sharing when working
>with the multimodal optimization problems  I've been using some of the
>concepts presented in Goldberg's book, but there is a big problem with a 
>combinatorial explosion in comparative operators (negating
>the speed improvements you get with GAs). My problem involoves non-binary
>string populations so I really need to find an efficient way of finding
>highly correlated strings.

Are you doing sequence comparison to determine what is "highly correlated"?
There is a lot of work in this area, much of it inspired by chromosome-
comparison.  The algorithms are still expensive (O(n*m) to compare
two sequences of length m and n; though I think there are some good
speed-up heuristics.)
---
Michael Turner
miket@tcs.com