Abstract: We consider a posteriori approach to the problem of noise- proof simultaneous detection and discrimination of subsequences-fragments having some given properties in a quasiperiodic sequence. The solution to the problem is stated for the case when the quantity of sought sub- sequences is unknown. We assume that 1) a nite alphabet of refer- ence sequences is given; 2) a set of permissible deformations is dened for the alphabet, this set gathers all possible extensions of its elements (by duplicating their components); 3) every subsequence-fragment in the quasiperiodic sequence belongs to the set of permissible deformations; 4) subsequences-fragments do not intersect each other, and the dierence between the initial positions of two neighboring fragments is limited from above by a given value. We show that in the framework of a posteriori approach, the problem of simultaneous detection and discrimination reduces to solving an unex- plored discrete optimization problem. A polynomial-time algorithm that guarantees the optimal solution to this optimization problem is proposed. The results of the numerical simulation are presented.

Cite: Mikhailova L. , Khamdullin S.
Simultaneous detection and discrimination of subsequences which are nonlinearly extended elements of the given sequences alphabet in a quasiperiodic sequence
11th International Conference on Optimization and Applications, OPTIMA 2020 28 сент. - 2 окт. 2020