AbstractPhenotype robustness, defined as the average mutational robustness of all the genotypes that map to a given phenotype, plays a key role in facilitating neutral exploration of novel phenotypic variation by an evolving population. By applying results from coding theory, we prove that the maximum phenotype robustness occurs when genotypes are organized as bricklayer’s graphs, so-called because they resemble the way in which a bricklayer would fill in a Hamming graph. The value of the maximal robustness is given by a fractal continuous everywhere but differentiable nowhere sums-of-digits function from number theory. Interestingly, genotype–phenotype maps for RNA secondary structure and the hydrophobic-polar (HP) model for protein folding can exhibit phenotype robustness that exactly attains this upper bound. By exploiting properties of the sums-of-digits function, we prove a lower bound on the deviation of the maximum robustness of phenotypes with multiple neutral components from the bricklayer’s graph bound, and show that RNA secondary structure phenotypes obey this bound. Finally, we show how robustness changes when phenotypes are coarse-grained and derive a formula and associated bounds for the transition probabilities between such phenotypes.

## 5 thoughts on “Maximum mutational robustness in genotype–phenotype maps follows a self-similar blancmange-like curve”

### Leave a Reply

You must be logged in to post a comment.

Eh?

This being an advance over the prevailing theory, which merely held that the curves were dessert-like. 🙂

I see that co-author, Ard Louis, has a hobby.

Gag.

I stumbled across an article explaining the paper and its significance:

Scientists Discover ‘Pure Math’ Is Written Into Evolutionary Genetics