This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a pair-wise distance to compare two symbolic sequences. We show that this covering distance is a semimetric. Few examples are given to show how this string semimetric ...

The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long-range correlation features which are observed in the genomic sequences of higher eucaryotes. A weighted network approach to symbolic sequences is introduced, and it is sh...

The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range correlation features which are observed in the genomic sequences of higher eucaryotes. A weighted network approach to symbolic sequences is introduced and it is sho...

Chemistry knowledge can be represented at macro-, microand symbolic levels, and learning a chemistry topic requires students to engage in multiple representational activities. This study focused on scaffolding for inter-level connection-making in learning chemistry knowledge with graphical simulations. We also tested whether different sequences of representational activities produced different ...

A measure of the ability of a symbolic sequence to be coded by initial fragments of another symbolic sequence is introduced and its basic properties are investigated. Applications to the characterization of symbolic sequences associated with shift mappings on a torus corresponding to a special partitioning of the torus and to multi-rate systems of coprocessors are considered. P. Diamond, P. Klo...

While entropy per unit time is a meaningful index to quantify the dynamic features of experimental time series, its estimation is often hampered in practice by the finite length of the data. We here investigate the performance of entropy estimation procedures, relying either on block entropies or Lempel-Ziv complexity, when only very short symbolic sequences are available. Heuristic analytical ...

The representations of assembly knowledge and assembly sequences are crucial in assembly planning, where the size of parts involved is a significant and often prohibitive difficulty. Zero-suppressed binary decision diagram (ZBDD) is an efficient form to represent and manipulate the sets of combination, and appears to give improved results for large-scale combinatorial optimization problems. In ...

A measure called Physical Complexity is established and calculated for a population of sequences, based on statistical physics, automata theory, and information theory. It is a measure of the quantity of information in an organism’s genome. It is based on Shannon’s entropy, measuring the information in a population evolved in its environment, by using entropy to estimate the randomness in the g...

We investigate the problem of modeling symbolic sequences of polyphonic music in a completely general piano-roll representation. We introduce a probabilistic model based on distribution estimators conditioned on a recurrent neural network that is able to discover temporal dependencies in high-dimensional sequences. Our approach outperforms many traditional models of polyphonic music on a variet...