Optimal detection of given number of identical subsequences in quasiperiodic sequence

The problem of the detection of given number of identical subsequences in quasiperiodic sequence distorted by the uncorrelated Gaussian interference with a known dispersion is studied. The aposteriori computing algorithm for the solution to this problem is justified. The case is considered, when the boundaries of an interval of the beginning and ending of the observations above the distorted sequence do not break the first and the last subsequence of hidden quasiperiodic sequence into two parts, and the instants of the begining of the subsequences are the determined values. It is established that the given problem is a particular problem of the test of the hypothesis about the mean of the Gaussian random vector. The recursion formulas of step by step discrete optimization ensuring maximum likelihood decsion are obtained. The estimation of temporary and capacitive of the algorithm is given. The outcomes of the numerical modeling are adduced.