|
Coding Theory
On the maximum number of non-confusable strings evolving under short tandem duplications
M. Kovačević University of Novi Sad
Received: 04.10.2021 Revised: 20.04.2022 Accepted: 21.04.2022
Citation:
M. Kovačević, “On the maximum number of non-confusable strings evolving under short tandem duplications”, Probl. Peredachi Inf., 58:2 (2022), 12–23
Linking options:
https://www.mathnet.ru/eng/ppi2365 https://www.mathnet.ru/eng/ppi/v58/i2/p12
|
Statistics & downloads: |
Abstract page: | 74 | References: | 17 | First page: | 16 |
|