Mutation and optimal search of sequences in nested Hamming spaces
Conference paper
Belavkin, R. 2011. Mutation and optimal search of sequences in nested Hamming spaces. IEEE Information Theory Workshop (ITW). Paraty, Brazil 16 - 20 Oct 2011 IEEE. pp. 90-94 https://doi.org/10.1109/ITW.2011.6089592
Type | Conference paper |
---|---|
Title | Mutation and optimal search of sequences in nested Hamming spaces |
Authors | Belavkin, R. |
Abstract | A representation of evolutionary systems is defined by sequences in nested Hamming spaces, which is analogous to variable length coding. Asexual reproduction is considered as a process of finding optimal codes, and conditions are formulated under which the optimal search operator is a simple random mutation, corresponding to binomial or Poisson process. Transition probability between spheres around an optimal sequence in each Hamming space is derived and used for optimal control of mutation rate. Several control functions are discussed, including a minimal information control that has a number of interesting properties. The theory makes a number of predictions about variability of length and mutation of DNA sequences in biological organisms. |
Research Group | Artificial Intelligence group |
Conference | IEEE Information Theory Workshop (ITW) |
Page range | 90-94 |
Proceedings Title | Proceedings of the Information Theory Workshop (ITW), 2011 |
ISBN | |
Hardcover | 9781457704383 |
Electronic | 9781457704376 |
Publisher | IEEE |
Publication dates | |
20 Oct 2011 | |
Online | 01 Dec 2011 |
Publication process dates | |
Deposited | 22 Feb 2012 |
Output status | Published |
Additional information | IEEE Information Theory Workshop (ITW), 16-20 October 2011 at Paraty, Brazil. |
Digital Object Identifier (DOI) | https://doi.org/10.1109/ITW.2011.6089592 |
Web of Science identifier | WOS:000299416200019 |
Language | English |
File |
https://repository.mdx.ac.uk/item/83812
Download files
46
total views8
total downloads0
views this month0
downloads this month