On the maximum number of non-confusable strings evolving under short tandem duplications

DOI10.1134/S0032946022020028zbMath1528.68333arXiv1911.06561MaRDI QIDQ6173451

No author found.

Publication date: 21 July 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.06561

zbMATH Keywords

error correctiontandem duplicationzero-error capacityDNA storagetandem repeatconstrained codesquare-free stringduplication errorrepetition errorsticky insertion

Mathematics Subject Classification ID

Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40) Synchronization error-correcting codes (94B50)

Cites Work

• Uniformly bounded duplication languages
• The Capacity of String-Duplication Systems
• Capacity and Expressiveness of Genomic Tandem Duplication
• Deciding the Confusability of Words under Tandem Repeats in Linear Time
• Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications
• Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

This page was built for publication: On the maximum number of non-confusable strings evolving under short tandem duplications