arXiv · 1308.5163
Evolving cellular automata for diversity generation and pattern recognition: deterministic versus random strategy
Abstract
Microbiological systems evolve to fulfill their tasks with maximal efficiency. The immune system is a remarkable example, where self-non self distinction is accomplished by means of molecular interaction between self proteins and antigens, triggering affinity-dependent systemic actions. Specificity of this binding and the infinitude of potential antigenic patterns call for novel mechanisms to generate antibody diversity. Inspired by this problem, we develop a genetic algorithm where agents evolve their strings in the presence of random antigenic strings and reproduce with affinity-dependent rates. We ask what is the best strategy to generate diversity if agents can rearrange their strings a finite number of times. We find that endowing each agent with an inheritable cellular automaton rule for performing rearrangements makes the system more efficient in pattern-matching than if transformations are totally random. In the former implementation, the population evolves to a stationary state where agents with different automata rules coexist.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marcio Argollo de Menezes, Edgardo Brigatti, Veit Schwämmle. 2013-08-23. Evolving cellular automata for diversity generation and pattern recognition: deterministic versus random strategy. https://doi.org/10.1088/1742-5468%2F2013%2F08%2Fp08006
Cite the original work for its findings. Save a collection to share your selection of sources.