争先恐后
编码(社会科学)
DNA
冗余(工程)
计算机科学
DNA合成
算法
并行计算
计算生物学
理论计算机科学
生物
数学
遗传学
统计
操作系统
作者
Kees A. Schouhamer Immink,Kui Cai,Tuan Thanh Nguyen,Jos H. Weber
出处
期刊:IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
[Institute of Electrical and Electronics Engineers]
日期:2024-05-15
卷期号:10 (2): 289-296
标识
DOI:10.1109/tmbmc.2024.3401583
摘要
We report on coding methods for efficiently synthesizing deoxyribonucleic acid (DNA) for massive data storage, where a plurality of DNA strands are synthesized in parallel. We examine the trade-offs between the information contents, redundancy, and the average or maximum number of cycles required for synthesizing a plurality of parallel DNA strands. We analyze coding methods such as guided scrambling and constrained codes for minimizing the cycle count.
科研通智能强力驱动
Strongly Powered by AbleSci AI