Logo image
Back
Entropy and complexity of finite sequences as fluctuating quantities
Journal article   Peer reviewed

Entropy and complexity of finite sequences as fluctuating quantities

Miguel A. Jiménez-Montaño, Werner Ebeling, Thomas Pohl and Paul E. Rapp
BioSystems, v 64(1), pp 23-32
2002
DOI: https://doi.org/10.1016/S0303-2647(01)00171-X
PMID: 11755485

Abstract

Algorithmic complexity Block entropies Diversity of entropy DNA sequences Spectrum of fluctuations Spike trains
The paper is devoted to the analysis of digitized sequences of real numbers and discrete strings, by means of the concepts of entropy and complexity. Special attention is paid to the random character of these quantities and their fluctuation spectrum. As applications, we discuss neural spike-trains and DNA sequences. We consider a given sequence as one realization of finite length of certain random process. The other members of the ensemble are defined by appropriate surrogate sequences and surrogate processes. We show that n-gram entropies and the context-free grammatical complexity have to be considered as fluctuating quantities and study the corresponding distributions. Different complexity measures reveal different aspects of a sequence. Finally, we show that the diversity of the entropy (that takes small values for pseudorandom strings) and the context-free grammatical complexity (which takes large values for pseudorandom strings) give, nonetheless, consistent results by comparison of the ranking of sample sequences taken from molecular biology, neuroscience, and artificial control sequences.

Metrics

3 Record Views
28 citations in Web of Science
30 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Biology
Mathematical & Computational Biology
Logo image