Estimating the significant non-linearities in the genome problem-coding

Substantial insight in the genome problem-coding can be gained if we know the most important Walsh coefficients - that is, the coefficients with large value. The practical use of the Walsh transform however is severely limited by the computational cost, even when using the Fast Walsh Transform. Part of this is caused by the fact that the transform computes all Walsh coefficients, not just the most significant. Here we discuss the use in a GA context of the recently developed KM algorithm, which estimates the most significant Walsh coefficients in a computational efficient way.