On the Reverse-Complement String-Duplication System
From MaRDI portal
Publication:6195764
DOI10.1109/TIT.2022.3182873arXiv2112.11811OpenAlexW4285254668MaRDI QIDQ6195764
Author name not available (Why is that?)
Publication date: 14 March 2024
Published in: (Search for Journal in Brave)
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 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.
Full work available at URL: https://arxiv.org/abs/2112.11811
No records found.
No records found.
This page was built for publication: On the Reverse-Complement String-Duplication System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195764)