Informational laws of genome structures

Area of Science:

• Genomics
• Bioinformatics
• Information Theory

Background:

• Genome analysis using k-mers provides insights into genome structure and function.
• The choice of k-mer length (k) is crucial for applying information theory to genomic data.
• Previous studies have not definitively established the optimal k for genomic information analysis.

Purpose of the Study:

• To determine the optimal k-mer length for applying information theoretic concepts to genome analysis.
• To define and compute genomic informational indexes based on optimal k.
• To propose a novel measure of genome complexity related to evolutionary dynamics.

Main Methods:

• Analysis of k-mers (strings of length k) within genomic sequences.
• Application of information theoretic concepts, specifically information entropies.
• Calculation of genomic informational indexes for seventy diverse genomes.
• Comparison of genomic indexes with those of random genome models.
• Development of a generalized logistic map for genome complexity.

Main Results:

• The optimal k-mer length is determined to be k = log2(n), where n is the genome length.
• Five genomic informational laws were identified, consistently observed across seventy analyzed genomes.
• A new genome complexity measure was proposed, integrating entropic and anti-entropic factors.
• The proposed complexity measure correlates with genome evolutionary dynamics.

Conclusions:

• The choice of k = log2(n) is optimal for defining informative genomic indexes.
• Genomes adhere to five fundamental informational laws, reflecting underlying organizational principles.
• The proposed complexity measure offers a new perspective on genome evolution and synthetic biology applications.