This paper addresses the problem of predicting the outcome of an ongoing case of a business process based on event logs. In this setting, the outcome of a case may refer for example to the achievement of a performance objective or the fulfillment of a compliance rule upon completion of the case. Given a log consisting of traces of completed cases, given a trace of an ongoing case, and given two...

Motivation: DNA sequences are fundamental for encoding genetic information. The genetic information may be understood not only by symbolic sequences but also from the hidden signals inside the sequences. The symbolic sequences need to be transformed into numerical sequences so the hidden signals can be revealed by signal processing techniques. All current transformation methods encode DNA seque...

This paper presents a hidden Markov model (HMM) based approach to on-line handwritten digit recognition using stroke sequences. In this approach, a character instance is represented by a sequence of symbolic strokes, and the representation is obtained by component segmentation and stroke classification. The component segmentation is based on the delta lognormal model of handwriting generation. ...

We derive an algorithm to recursively determine the lap number (minimal number of monotonicity segments) of the iterates of twice differentiable l-modal map, enabling to numerically calculate the topological entropy of these maps. The algorithm is obtained by the min-max sequences—symbolic sequences that encode qualitative information about all the local extrema of iterated maps.

the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital sig...

The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use of fundamental tools of symbolic computation, such as holonomic functions and asymptotic analysis ...

This chapter introduces various visualization (i.e., graphical representation) schemes of symbolic DNA sequences, which are basically represented by character strings in conventional sequence databases. Several visualization schemes are reviewed and their characterizations are summarized for comparison. Moreover, further potential applications based on the visualized sequences are discussed. By...