The structure of the genetic code as an optimal graph clustering problem.

Area of Science:

• Genetics
• Bioinformatics
• Graph Theory

Background:

• The standard genetic code (SGC) translates nucleotide codons into amino acids, but its origin and structure remain debated.
• Assessing the optimality of the SGC's structure is crucial for understanding its evolution.

Purpose of the Study:

• To introduce a novel graph theory-based approach for evaluating the quality of the genetic code structure.
• To analyze the robustness of codon groups against nucleotide substitutions using conductance.

Main Methods:

• Described the genetic code as a partition of an undirected, unweighted graph.
• Applied graph theory concepts, specifically conductance, to measure the robustness of codon groups.
• Investigated the genetic code structure as a solution to the graph clustering problem.

Main Results:

• The proposed methodology reveals new properties of the genetic code in terms of conductance.
• The standard genetic code, while not globally optimal by conductance, exhibits many codon groups with minimal conductance for their size.
• Optimal code structures according to conductance were identified and discussed.

Conclusions:

• The genetic code structure can be understood as a solution to a graph clustering problem.
• The SGC's structure may represent a local minimum for minimizing errors in protein-coding sequences and translation.