Sublinear growth of information in DNA sequences

DOI10.1016/J.BULM.2004.10.005MaRDI QIDQ263483zbMATH OpenOpenAlexWikidataFDO

Authors Giulia Menconi

Publication date 5 April 2016

Published in Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/q-bio/0402046

zbMATH Keywords

adaptive compression algorithminformation growthLempel-Ziv scheme

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Information theory (general) (94A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

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.

Recommendations

• Data compression and genomes: a two-dimensional life domain map
• The principles of informational genomics
• Shannon information and self-similarity in whole genomes
• Information theory in genome analysis
• STATISTICAL AND LINGUISTIC FEATURES OF DNA SEQUENCES

Cited in

(6)

• A study of entropy/clarity of genetic sequences using metric spaces and fuzzy sets
• Shannon information and self-similarity in whole genomes
• Textual data compression in computational biology: algorithmic techniques
• Data compression and genomes: a two-dimensional life domain map
• An extension of fuzzy topological approach for comparison of genetic sequences
• Repeated sequences in linear genetic programming genomes

This page was built for publication: Sublinear growth of information in DNA sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263483)