TITLE: Combinatorics of Mutation and Recombination of Strings in Hamming Space
SPEAKER: Roman V. Belavkin (Middlesex University)

ABSTRACT:

Mutation and recombination of strings are two operators used in evolutionary systems to produce new strings.  Optimization of these operators is an important problem both for evolutionary computation and biology.  Previously, I derived a combinatorial formula for mutation in a Hamming space of strings that allowed for finding optimal mutation rates.  In this talk, I will present a similar formula for recombination.