A study on allelic recombination

Allelic representations are based on characterizing points of the search space as variable-size feature sets. Recombination processes are studied here from the point of view of this kind of representations. We focus on the structure of the information units manipulated during the process, and in the algorithmic aspects of this manipulation. In this sense, we provide a generic algorithmic template whose sufficiency is established. Moreover, the syntactic properties of the information units manipulated are analyzed and exemplified. This is done within the framework of forma analysis.