Abstract
Classic genetic algorithms (GA) incorporate a concept of variability in genotype to phenotype mapping only by the notion of generative encodings. In such cases, the phenotype depends not only on the pure values of genes but also on their interaction and influence of other factors like the environment. In case of generative encoding GA not exact phenotype of an individual is inherited but the isomorphic function to form the individual. The same information may lead to the formation of different phenotypes due to alterations in conditions or permutations in the gene sequence. We propose a mathematical definition of the abstract notion of genetic variability and a new approach to the problem of the genotype transition to a new generation called “isotopic inheritance”. To this extent, we apply the notion of topological isotopy and use the branch of low-dimensional topology, known as braid theory to encode the values of a gene of arbitrary length into the genome and to propagate the isomorphic genotypes among the offspring. We illustrate the propositional variations of such encoding in different applications. Multiple knapsack problem was solved using the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bengtsson, B.O.: Genetic variation in organisms with sexual and asexual reproduction. J. Evol. Biol. 16, 189–199 (2003)
Pigliucci, M.: Genotype-phenotype mapping and the end of the ‘genes as blueprint’ metaphor. Phil. Trans. R. Soc. B. 365, 557–566 (2010)
Brindle, A.: Genetic algorithms for function optimization (Doctoral dissertation and Technical report TR81-2). University of Alberta, Edmonton (1981)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Hinton, G.E., Nowlan, S.J.: How learning can guide evolution. Complex Syst. 1(3), 495–502 (1987)
Kargupta, H.: The gene expression messy genetic algorithm. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 814–819, Nagoya (1996)
Eggenberger, P.: Evolving morphologies of simulated 3D organisms based on differential gene expression. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 205–213. MIT Press, Cambridge (1997)
Ferreira, C.: Gene expression programming: a new adaptive algorithm for solving problems. Complex Syst. 13(2), 87–129 (2001)
Wu, A.S., Garibay, I.: The proportional genetic algorithm: gene expression in a genetic algorithm. Genetic Program. Evolvable Mach. 3(2), 157–192 (2002)
Ross, B.: A Lamarckian evolution strategy for genetic algorithms. In: Chambers, L.D. (ed.) Practical Handbook of Genetic Algorithms: Complex Coding Systems, vol. 3, pp. 1–16. CRC Press, Boca Raton (1999)
Kowaliw, T., Grogono, P., Kharma, N.: Bluenome: a novel developmental model of artificial morphogenesis. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 93–104. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24854-5_9
Auerbach, J.E., Bongard, J.C.: Environmental influence on the evolution of morphological complexity in machines. PLOS Comput. Biol. 10(1), e1003399 (2014)
Kriegman, S., Cheney, N., Corucci, F., Bongard, J.C.: A minimal developmental model can increase evolvability in soft robots. In: Proceedings of GECCO 2017, pp. 131–138. ACM, New York (2017)
Veenstra, F., Faina, A., Risi, S., Stoy, K.: Evolution and morphogenesis of simulated modular robots: a comparison between a direct and generative encoding. In: Squillero, G., Sim, K. (eds.) EvoApplications 2017. LNCS, vol. 10199, pp. 870–885. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55849-3_56
Stanley, K.O., DAmbrosio, D.B., Gauci, J.: A hypercube-based indirect encoding for evolving largescale neural networks. Artif. Life 15(2), 185–212 (2009)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)
Lo, H.S., et al.: Allelic variation in gene expression is common in the human genome. Genome Res. 13(8), 1855–1862 (2003)
Lobo, I.: Same genetic mutation, different genetic disease phenotype. Nature Educ. 1(1), 64 (2008)
LaFave, M.C., Sekelsky, J.: Mitotic recombination: why? when? how? where? PLoS Genet. 5(3), e1000411 (2009)
Haldane, J.B.S.: The interaction of nature and nurture. Ann. Eugen. 13, 197–202 (1946)
Lukyanova, O., Nikitin, O.: Neuronal topology as set of braids: information processing, transformation and dynamics. Opt. Memory Neural Netw. (Inf. Optics) 26(3), 172–181 (2017)
Sossinsky, A.: Knots, Mathematics with a Twist. Harvard University Press, Cambridge (2002)
Kassel, C., Turaev, V.: Braid Groups. Graduate Texts in Mathematics. Springer, New York (2008). https://doi.org/10.1007/978-0-387-68548-9
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
Acknowledgments
The research was funded by RFBR project No. 18-31-00188. The calculations were carried out using methods and technologies which development was funded by the grant of the Program of Basic Research FEB RAS “Far East” to the research projects No. 18-5-100. The computing resources of the Shared Facility Center “Data Center of FEB RAS” (Khabarovsk) were used to carry out calculations. We thank Alexey Kunin for technical assistance in the preparation of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Lukyanova, O., Nikitin, O. (2018). Isotopic Inheritance: A Topological Approach to Genotype Transfer. In: Manoonpong, P., Larsen, J., Xiong, X., Hallam, J., Triesch, J. (eds) From Animals to Animats 15. SAB 2018. Lecture Notes in Computer Science(), vol 10994. Springer, Cham. https://doi.org/10.1007/978-3-319-97628-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-97628-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97627-3
Online ISBN: 978-3-319-97628-0
eBook Packages: Computer ScienceComputer Science (R0)