On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications
Crossref DOI link: https://doi.org/10.1134/S0032946022020028
Published Online: 2022-07-11
Published Print: 2022-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kovačević, M.
Text and Data Mining valid from 2022-04-01
Version of Record valid from 2022-04-01
Article History
Received: 4 October 2021
Revised: 20 April 2022
Accepted: 21 April 2022
First Online: 11 July 2022