Memory Order Decomposition of Symbolic Sequences

04/15/2021
by   Unai Alvarez-Rodriguez, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2018

Sequence Covering Similarity for Symbolic Sequence Comparison

This paper introduces the sequence covering similarity, that we have for...
research
09/16/2021

Emergence of functional information from multivariate correlations

The information content of symbolic sequences (such as nucleic- or amino...
research
07/06/2020

Learning the Markov order of paths in a network

We study the problem of learning the Markov order in categorical sequenc...
research
03/20/2021

Markov Modeling of Time-Series Data using Symbolic Analysis

Markov models are often used to capture the temporal patterns of sequent...
research
07/05/2021

Time-irreversibility tests for random-length time series: the matching-time approach applied to DNA

In this work we implement the so-called matching time estimators for est...
research
02/21/2020

Symbolic Execution Game Semantics

We present a framework for symbolically executing and model checking hig...
research
07/13/2020

Predicting Sequences of Traversed Nodes in Graphs using Network Models with Multiple Higher Orders

We propose a novel sequence prediction method for sequential data captur...

Please sign up or login with your details

Forgot password? Click here to reset