We introduce a general method for the study of memory in symbolic sequences based on higher-order Markov analysis. The Markov process that best represents a sequence is expressed as a mixture of matrices of minimal orders, enabling the definition of the so-called memory profile, which unambiguously reflects the true order of correlations. The method is validated by recovering the memory profiles of tunable synthetic sequences. Finally, we scan real data and showcase with practical examples how our protocol can be used to extract relevant stochastic properties of symbolic sequences
This dissertation presents two statistical methodologies developed on multi-order Markov models. Fir...
We propose a novel approach for building finite memory predictive models similar in spirit to variab...
Variable order markov chains have been applied to a variety of problems in computational biology, fr...
A theory of symbolic dynamic systems with long-range correlations based on the consideration of the ...
An information-theoretic approach to numerically determine the Markov order of discrete stochastic p...
An information-theoretic approach to numerically determine the Markov order of discrete stochastic p...
A theory of systems with long-range correlations based on the consideration of binary N-step Markov ...
This dissertation presents two statistical methodologies developed on multi-order Markov models. Fir...
We address this work to investigate symbolic sequences with long-range correlations by using computa...
A new approach to describing correlation properties of complex dynamic systems with long-range memor...
A measure called physical complexity is established and calculated for a population of sequences, ba...
This article presents the PST R package for categorical sequence analysis with probabilistic suffix ...
A method is outlined for estimating the order of a Markov process, and applied to both model and exp...
We introduce Markov models for segmentation of symbolic sequences, extending a segmentation procedur...
Two approaches to studying the correlation functions of the binary Markov sequences are considered. ...
This dissertation presents two statistical methodologies developed on multi-order Markov models. Fir...
We propose a novel approach for building finite memory predictive models similar in spirit to variab...
Variable order markov chains have been applied to a variety of problems in computational biology, fr...
A theory of symbolic dynamic systems with long-range correlations based on the consideration of the ...
An information-theoretic approach to numerically determine the Markov order of discrete stochastic p...
An information-theoretic approach to numerically determine the Markov order of discrete stochastic p...
A theory of systems with long-range correlations based on the consideration of binary N-step Markov ...
This dissertation presents two statistical methodologies developed on multi-order Markov models. Fir...
We address this work to investigate symbolic sequences with long-range correlations by using computa...
A new approach to describing correlation properties of complex dynamic systems with long-range memor...
A measure called physical complexity is established and calculated for a population of sequences, ba...
This article presents the PST R package for categorical sequence analysis with probabilistic suffix ...
A method is outlined for estimating the order of a Markov process, and applied to both model and exp...
We introduce Markov models for segmentation of symbolic sequences, extending a segmentation procedur...
Two approaches to studying the correlation functions of the binary Markov sequences are considered. ...
This dissertation presents two statistical methodologies developed on multi-order Markov models. Fir...
We propose a novel approach for building finite memory predictive models similar in spirit to variab...
Variable order markov chains have been applied to a variety of problems in computational biology, fr...