On the Reverse-Complement String-Duplication System

Eyar Ben-Tolila, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by DNA storage in living organisms, and by known biological mutation processes, we study the reverse-complement string-duplication system. We fully classify the conditions under which the system has full expressiveness, for all alphabets and all fixed duplication lengths. We then focus on binary systems with duplication length 2 and prove that they have full capacity, yet surprisingly, have zero entropy-rate. Finally, by using binary single burst-insertion correcting codes, we construct codes that correct a single reverse-complement duplication of odd length, over any alphabet. The redundancy (in bits) of the constructed code does not depend on the alphabet size.

Original languageAmerican English
Pages (from-to)7184-7197
Number of pages14
JournalIEEE Transactions on Information Theory
Volume68
Issue number11
DOIs
StatePublished - 1 Nov 2022

Keywords

  • String-duplication systems
  • capacity
  • entropy rate
  • error-correcting codes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'On the Reverse-Complement String-Duplication System'. Together they form a unique fingerprint.

Cite this