title: Informational laws of genome structures.
abstract: In recent years, the analysis of genomes by means of strings of length k occurring in the genomes, called k-mers, has provided important insights into the basic mechanisms and design principles of genome structures. In the present study, we focus on the proper choice of the value of k for applying information theoretic concepts that express intrinsic aspects of genomes. The value k = lg2(n), where n is the genome length, is determined to be the best choice in the definition of some genomic informational indexes that are studied and computed for seventy genomes. These indexes, which are based on information entropies and on suitable comparisons with random genomes, suggest five informational laws, to which all of the considered genomes obey. Moreover, an informational genome complexity measure is proposed, which is a generalized logistic map that balances entropic and anti-entropic components of genomes and is related to their evolutionary dynamics. Finally, applications to computational synthetic biology are briefly outlined.
authors.affiliation: University of Verona, Department of Computer Science, University of Verona, Verona 37134, Italy.|Center for BioMedical Computing, University of Verona, Verona, 37134, Italy.
authors.forename: Vincenzo
authors.initials: V
authors.lastname: Bonnici
authors.affiliation: University of Verona, Department of Computer Science, University of Verona, Verona 37134, Italy.|Center for BioMedical Computing, University of Verona, Verona, 37134, Italy.
authors.forename: Vincenzo
authors.initials: V
authors.lastname: Manca
mesh_terms: D000465:Algorithms; D000818:Animals; D019295:Computational Biology; D019277:Entropy; D019143:Evolution, Molecular; D016678:Genome; D006801:Humans; D008957:Models, Genetic