Mutation and optimal search of sequences in nested Hamming spaces

Belavkin, Roman V. (2011) Mutation and optimal search of sequences in nested Hamming spaces. In: Proceedings of the Information Theory Workshop (ITW), 2011. IEEE, pp. 90-94. ISBN 9781457704383

[img]
Preview
PDF
192kB

Official URL: http://dx.doi.org/10.1109/ITW.2011.6089592

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.

Item Type:Book Section
Additional Information:

IEEE Information Theory Workshop (ITW), 16-20 October 2011 at Paraty, Brazil.

Research Areas:Middlesex University Schools and Centres > School of Science and Technology > Computer Science
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Artificial Intelligence group
ID Code:8398
Useful Links:
Deposited On:22 Feb 2012 04:55
Last Modified:31 Oct 2014 09:33

Repository staff only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year