Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (Q1395276)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1940649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Posterior detection of a given number of identical subsequences in a quasi-periodic sequence |
scientific article; zbMATH DE number 1940649 |
Statements
Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (English)
0 references
1 July 2003
0 references
This paper is devoted to the problem of detection of a given number of identical subsequences in a quasi-periodic sequence distorted by uncorrelated Gaussian noise with a known variance. A posterior computational algorithm for this problem is justified. This problem is shown to be a specific hypothesis-testing problem for the mean of a Gaussian random vector. Recurrence formulas based on maximum likelihood are obtained for stepwise discrete optimization.
0 references
detection
0 references
identical subsequences
0 references
Gaussian noise
0 references
variance
0 references
computational algorithm
0 references
maximum likelihood
0 references
hypothesis-testing
0 references
0.89763325
0 references
0.8841596
0 references
