Posterior detection of a given number of identical subsequences in a quasi-periodic sequence

zbMath1023.60044MaRDI QIDQ1395276

Alexander Kel'Manov, Sergey Khamidullin

Publication date: 1 July 2003

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

Gaussian noisecomputational algorithmvariancemaximum likelihooddetectionhypothesis-testingidentical subsequences

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Estimation and detection in stochastic control theory (93E10) Signal detection and filtering (aspects of stochastic processes) (60G35) Detection theory in information and communication theory (94A13)

Related Items (12)

Problem of minimizing a sum of differences of weighted convolutions ⋮ A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem ⋮ A randomized algorithm for a sequence 2-clustering problem ⋮ 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence ⋮ An approximation polynomial-time algorithm for a sequence bi-clustering problem ⋮ Unnamed Item ⋮ Recognition of a sequence as a structure containing series of recurring vectors from an alphabet ⋮ On polynomial solvability of one quadratic Euclidean clustering problem on a line ⋮ Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem ⋮ Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence ⋮ Easy NP-hardness Proofs of Some Subset Choice Problems ⋮ The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

This page was built for publication: Posterior detection of a given number of identical subsequences in a quasi-periodic sequence