Simultaneous Detection and Discrimination of the Known Number of Non-Linearly Extended Alphabet Elements in a Quasiperiodic Sequence Full article
| Conference |
12th International Conference on Optimization and Applications 27 Sep - 1 Oct 2021 , Moscow |
||
|---|---|---|---|
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||
| Output data | Year: 2021, Pages: 171-183 Pages count : 13 DOI: 10.1007/978-3-030-92711-0_12 | ||
| Tags | Detection; Discrete optimization problem; Discrimination; Non-linear extension; Polynomial-tyme solvability; Quasiperiodic sequence | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
The paper is devoted to one unexplored discrete optimization problem. This problem arises when applying
the non-traditional a posteriori approach to the applied problem of simultaneous detection and
discrimination of the given number of subsequences-fragments coinciding with non-linearly extended
elements of the given sequence alphabet in a quasiperiodic sequence. It is constructively proved that this
optimization problem is polynomial-time solvable. The numerical simulation results are presented.
Cite:
Mikhailova L.
Simultaneous Detection and Discrimination of the Known Number of Non-Linearly Extended Alphabet Elements in a Quasiperiodic Sequence
Communications in Computer and Information Science. 2021. P.171-183. DOI: 10.1007/978-3-030-92711-0_12 Scopus OpenAlex
Simultaneous Detection and Discrimination of the Known Number of Non-Linearly Extended Alphabet Elements in a Quasiperiodic Sequence
Communications in Computer and Information Science. 2021. P.171-183. DOI: 10.1007/978-3-030-92711-0_12 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85121875663 |
| OpenAlex: | W4206075466 |
Citing:
Пока нет цитирований