Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets

Authors:
M. T. Iglesias;B. Naudts;A. Verschoren;C. Vidal
Affiliations:
Universidade da Coruña, A Coruña, Spain;Universiteit Antwerpen, Antwerp, Belgium;Universiteit Antwerpen, Antwerp, Belgium;Universidade da Coruña, A Coruña, Spain
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 4
Cited 2

Foundations of genetic algorithms

Foundations of genetic algorithms
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms as function optimizers

Genetic algorithms as function optimizers
Predicting epistasis from mathematical models

Evolutionary Computation

Extended probe method for linkage discovery over high-cardinality alphabets

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Detecting the epistatic structure of generalized embedded landscape

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note, we indicate how the basic machinery of Walsh transforms can be generalized from the binary case ([3, 4]) to multary alphabets. Our main results show how Walsh coefficients are related to partition coefficients and how they may be used to calculate schema averages.