The spiderweb of error-detecting codes in the...
URL: https://www.sciencedirect.com/science/article/pii/S0303264723001843?via%3Dihub
Title: The spiderweb of error-detecting codes in the genetic information
Author(s): Fimmel, E., Strüngmann, L.
DOI: https://doi.org/10.1016/j.biosystems.2023.105009
Publication Date: 26 August 2023
Resource Type: Research paper
Format: Link
Working Group: WG1-WG2
Affiliation(s): 1)Institute of Mathematical Biology, Faculty for Computer Sciences, Mannheim; 2) University of Applied Sciences, 68163 Mannheim, Germany
Access Status: Restricted
Keywords:
Description: Nature possesses inherent mechanisms for error detection and correction during the translation of genetic information, as demonstrated by the discovery of a self-complementary circular C3-code called X0 in various organisms such as bacteria, eukaryotes, plasmids, and viruses (Arquès and Michel, 1996; Michel, 2015, 2017). Since then, extensive research has focused on circular codes, which are believed to be remnants of ancient comma-free codes. These codes can be regarded as an additional genetic code specifically optimized for detecting and preserving the proper reading frame in protein-coding sequences. A study by Fimmel et al. in 2014 identified that a total of 216 maximal self-complementary C3-codes can be grouped into 27 equivalence classes with eight codes in each class. In this work, we study how the 27 equivalence classes are related to each other. While the codes in each equivalence class obtained by Fimmel et al. in 2014 are permutations of each other, i.e. one code can be obtained from the other by applying a permutation of the bases, it has not been clear how the equvalence classes are connected. We show that there is an ordering of the equivalence classes such that one gets from one class to the next one by substituting only one pair of codon/anticodon in the corresponding codes, i.e. the corresponding codes have a maximal intersection of 18 codons. To perform this analysis, we define two graphs, G216 and G27, whose vertices are, respectively, all 216 maximal self-complementary C3-codes and 27 equivalence classes. Several properties of the graphs are obtained. Most surprisingly, it turns out that G27 contains Hamiltonian paths of length 27. This fact ultimately leads to a representation of the set of all 216 maximal self-complementary C3-codes as a kind of spider web. Finally, we define dinucleotide cuts of such codes by projecting each codon to its first two bases and show that the paths of lengths 27 in G216 can even be chosen so that all the codes contain a special subset of dinucleotides defined by Rumer’s roots. These observations raise a lot of new questions about the biological function of such structures.
Non è stata ancora creata alcuna vista per questa risorsa.
Informazioni supplementari
| Campo | Valore |
|---|---|
| Data last updated | 31 ottobre 2025 |
| Metadata last updated | 31 ottobre 2025 |
| Creato | 31 ottobre 2025 |
| Formato | HTML |
| Licenza | Licenza non specificata |
| Id | c4b4d18c-b061-4b97-81bb-dad719f5c13e |
| Package id | 46c24fbe-8177-4fb5-b962-e10b09cfb982 |
| State | active |