pith. sign in

arxiv: q-bio/0402046 · v1 · submitted 2004-02-27 · 🧬 q-bio.GN · cond-mat.stat-mech· physics.data-an

Sublinear Growth of Information in DNA Sequences

classification 🧬 q-bio.GN cond-mat.stat-mechphysics.data-an
keywords informationalgorithmfunctiongrowthsublinearadaptiveanalysecomplete
0
0 comments X
read the original abstract

We introduce a novel method to analyse complete genomes and recognise some distinctive features by means of an adaptive compression algorithm, which is not DNA-oriented. We study the Information Content as a function of the number of symbols encoded by the algorithm. Preliminar results are shown concerning regions having a sublinear type of information growth, which is strictly connected to the presence of highly repetitive subregions that might be supposed to have a regulatory function within the genome.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.