Sublinear Growth of Information in DNA Sequences

Simple item page
dc.creatorMenconi, Giulia
dc.date2004-02-27
dc.date.accessioned2026-07-07T05:58:15Z
dc.date.available2026-07-07T05:58:15Z
dc.descriptionWe 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.
dc.description30 pages, 13 figures, submitted (Oct. 2003)
dc.identifierhttps://arxiv.org/abs/q-bio/0402046
dc.identifierhttp://arxiv.org/abs/q-bio/0402046
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88291
dc.subjectGenomics
dc.subjectStatistical Mechanics
dc.subjectData Analysis, Statistics and Probability
dc.titleSublinear Growth of Information in DNA Sequences
dc.typetext

Files

Collections

arXiv