Pages that link to "Item:Q1395276"
From MaRDI portal
The following pages link to Posterior detection of a given number of identical subsequences in a quasi-periodic sequence (Q1395276):
Displaying 14 items.
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- Problem of minimizing a sum of differences of weighted convolutions (Q828127) (← links)
- On polynomial solvability of one quadratic Euclidean clustering problem on a line (Q2279767) (← links)
- Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem (Q2284268) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- (Q4527365) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- (Q5048139) (← links)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
- The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension (Q5214428) (← links)
- Recognition of a sequence as a structure containing series of recurring vectors from an alphabet (Q5413145) (← links)
- One segregation problem for the sum of two quasiperiodic sequences (Q6588739) (← links)
