The Quality of Genetic Code Models in Terms of Their Robustness Against Point Mutations
- 33 Downloads
In this paper, we investigate the quality of selected models of theoretical genetic codes in terms of their robustness against point mutations. To deal with this problem, we used a graph representation including all possible single nucleotide point mutations occurring in codons, which are building blocks of every protein-coding sequence. Following graph theory, the quality of a given code model is measured using the set conductance property which has a useful biological interpretation. Taking this approach, we found the most robust genetic code structures for a given number of coding blocks. In addition, we tested several properties of genetic code models generated by the binary dichotomic algorithms (BDA) and compared them with randomly generated genetic code models. The results indicate that BDA-generated models possess better properties in terms of the conductance measure than the majority of randomly generated genetic code models and, even more, that BDA-models can achieve the best possible conductance values. Therefore, BDA-generated models are very robust towards changes in encoded information generated by single nucleotide substitutions.
KeywordsGenetic code Dichotomy classes Point mutations
We would like to thank Lutz Strüngmann for stimulating discussions.
- Blazej P, Kowalski D, Mackiewicz D, Wnetrzak M, Aloqalaa D, Mackiewicz P (2018b) The structure of the genetic code as an optimal graph clustering problem. https://doi.org/10.1101/332478
- Schönauer S, Clote P (1997) How optimal is the genetic code? In: Frishman D, Mewes HW (eds) Computer science and biology proceedings of the german conference on bioinformatics (GCB’97), pp 65–67Google Scholar