Mutation and optimal search of sequences in nested Hamming spaces

Belavkin, Roman V. ORCID: https://orcid.org/0000-0002-2356-1447 (2011) Mutation and optimal search of sequences in nested Hamming spaces. Proceedings of the Information Theory Workshop (ITW), 2011.. In: IEEE Information Theory Workshop (ITW), 16-20 Oct 2011, Paraty, Brazil. ISBN 9781457704383, e-ISBN 9781457704376. [Conference or Workshop Item] (doi:10.1109/ITW.2011.6089592)

Preview

PDF - UNSPECIFIED Download (192kB) | Preview

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.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

252Downloads

6 month trend

436Hits

Additional statistics are available via IRStats2.