| Publication | Date of Publication | Type |
|---|
| A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence | 2024-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5048139 | 2022-11-15 | Paper |
| Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences | 2021-08-24 | Paper |
| An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem | 2021-05-18 | Paper |
| One Problem of the Sum of Weighted Convolution Differences Minimization, Induced by the Quasiperiodic Sequence Recognition Problem | 2021-02-25 | Paper |
| Problem of minimizing a sum of differences of weighted convolutions | 2021-01-08 | Paper |
| 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence | 2020-09-22 | Paper |
| Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence | 2020-02-11 | Paper |
| A randomized algorithm for a sequence 2-clustering problem | 2019-06-07 | Paper |
| An Approximation Scheme for the Problem of Finding a Subsequence | 2018-04-20 | Paper |
| An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities | 2018-04-20 | Paper |
| An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities | 2018-02-13 | Paper |
| Approximation algorithm for the problem of partitioning a sequence into clusters | 2017-12-06 | Paper |
| Exact pseudopolynomial algorithm for one sequence partitioning problem | 2017-07-07 | Paper |
| A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem | 2016-08-12 | Paper |
| An approximation polynomial-time algorithm for a sequence bi-clustering problem | 2015-09-29 | Paper |
| An approximating polynomial algorithm for a sequence partitioning problem | 2015-07-27 | Paper |
| Approximation algorithms for some intractable problems of choosing a vector subsequence | 2015-07-17 | Paper |
| Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence | 2013-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115185 | 2012-02-20 | Paper |
| Recognition of a quasiperiodic sequence that includes a repeating set of fragments | 2011-06-08 | Paper |
| A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence | 2011-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2998997 | 2011-05-11 | Paper |
| Joint a-posteriori detection and identification of quasiperiodic fragments in a sequence from pieces of them | 2011-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161901 | 2010-10-18 | Paper |
| Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence | 2010-10-18 | Paper |
| A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure | 2010-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817499 | 2004-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434976 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429331 | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428016 | 2003-09-14 | Paper |
| Posterior detection of a given number of identical subsequences in a quasi-periodic sequence | 2003-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787988 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788000 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787989 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517345 | 2000-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951202 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951373 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951235 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936525 | 2000-01-31 | Paper |
