Adaptable DNA Storage Coding: An Efficient Framework for Homopolymer Constraint Transitionsopen access
- Authors
- Gao, Yunfei; No, Albert
- Issue Date
- 2024
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Costs; DNA; DNA storage; DNA-to-DNA coding; Edit distance; Encoding; Error correction codes; GC contents; Homopolymer constraint; Image coding; Sequential analysis; Symbols
- Citation
- IEEE Access, v.12, pp 1 - 1
- Pages
- 1
- Journal Title
- IEEE Access
- Volume
- 12
- Start Page
- 1
- End Page
- 1
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/32629
- DOI
- 10.1109/ACCESS.2024.3353305
- ISSN
- 2169-3536
- Abstract
- Many DNA storage codes take into account homopolymer and GC-content constraints. Still, these codes often need to meet additional practical database requirements, such as error correction and data queries, necessitating considerable financial and time investment in their training or design. As DNA storage technologies, including sequencing and synthesis, continue to evolve rapidly, these codes may need to be retrained or redesigned to adapt to new constraints. In this study, we aim to design a method for adapting an existing DNA storage code to satisfy a new constraint, specifically concerning homopolymer variations. We present a simple and effective framework known as Transfer Coding, which directly maps DNA sequences from an original homopolymer constraint <italic>h</italic>1 to a new constraint <italic>h</italic>2. This approach essentially combines the existing coding scheme with a Transfer encoder. The proposed method uses strategic base replacements to ensure compliance with constraints, achieving results close to the theoretical limit while keeping alterations to the original sequence minimal. Authors
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electronic & Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.