Informational laws of genome structures.

Sci Rep

University of Verona, Department of Computer Science, University of Verona, Verona 37134, Italy.

Published: June 2016

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.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4937431PMC
http://dx.doi.org/10.1038/srep28840DOI Listing

Publication Analysis

Top Keywords

informational laws
8
genome structures
8
genomes
7
informational
4
genome
4
laws genome
4
structures years
4
years analysis
4
analysis genomes
4
genomes strings
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!