<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Konrad Miazga</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GOM-Based Compatible Substitutions Optimization for Variable-Length Representation Gray-Box Problems</style></title><secondary-title><style face="normal" font="default" size="100%">Genetic and Evolutionary Computation Conference (GECCO '25 Companion)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2025</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/GOM-BasedCompatibleSubstitutionsOptimization.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Effective recombination operators utilizing interdependence of genes ensure that specific arrangements or combinations of genes are preserved, allowing offspring to inherit beneficial traits from both parents without disrupting important gene interactions. However, such operators are easiest to implement for fixed-length genetic representations such as vectors of genes. In this work, we show that for some problems with variable-length representations, it is possible to design an algorithm that employs the GOM (Gene-pool Optimal Mixing) operator without the need to learn dependencies between specific genes. Instead, our approach - Compatible Substitutions Optimization (CoSO) - leverages expert-driven models of compatible substitutions that take advantage of the characteristics of the representation. Our experiments indicate that the proposed method performs better than standard evolutionary algorithms on a problem of evolving tall 3D structures, while also providing significant potential for further enhancements.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Szymon Ulatowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Genetic mappings in artificial genomes</style></title><secondary-title><style face="normal" font="default" size="100%">Theory in Biosciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/GeneticMappingsInArtificialGenomes.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">123</style></volume><pages><style face="normal" font="default" size="100%">125–137</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper concerns processing of genomes of artificial (computer-simulated) organisms. Of special interest is the process of translation of genotypes into phenotypes, and utilizing the mapping information obtained during such translation. If there exists more than one genetic encoding in a single artificial life model, then the translation may also occur between different encodings. The obtained mapping information allows to present genes-phenes relationships visually and interactively to a person, in order to increase understanding of the genotype-to-phenotype translation process and genetic encoding properties. As the mapping associates parts of the source sequence with the translated destination, it may be also used to trace genes, phenes, and their relationships during simulated evolution. 

A mappings composition procedure is formally described, and a simple method of visual mapping presentation is established. Finally, advanced visualizations of gene-phene relationships are demonstrated as practical examples of introduced techniques. These visualizations concern genotypes expressed in various encodings, including an encoding which exhibits polygenic and pleiotropic properties.</style></abstract></record></records></xml>