{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T04:03:41Z","timestamp":1754021021550,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3s","license":[{"start":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T00:00:00Z","timestamp":1677196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2023,10,31]]},"abstract":"<jats:p>\n            The work aims to study the application of\n            <jats:bold>Deoxyribonucleic Acid (DNA)<\/jats:bold>\n            multi-source data storage in\n            <jats:bold>Digital Twins (DT)<\/jats:bold>\n            . Through the investigation of the research status of DT and DNA computing, the work puts forward the concept of DNA multi-source data storage for DT. Raptor code is improved from the design direction of degree distribution function, and six degree function distribution schemes are proposed in turn in the process of describing the research method. Additionally, a quaternary dynamic Huffman coding method is applied in DNA data storage, combined with the improved concatenated code as the error correction code. Considering the content of\n            <jats:bold>cytosine deoxynucleotide (C)<\/jats:bold>\n            and\n            <jats:bold>guanine deoxynucleotide Guanine (G)<\/jats:bold>\n            and the distribution of homopolymer in DNA storage, the work proposes and verifies an improved concatenated code algorithm\n            <jats:bold>Deoxyribonucleic Acid-Improved Concatenated code (DNA-ICC)<\/jats:bold>\n            . The results show that while the\n            <jats:bold>Signal-to-Noise Ratio (SNR)<\/jats:bold>\n            increases, the\n            <jats:bold>Bit Error Rate (BER)<\/jats:bold>\n            decreases gradually and the trend is similar. But the anti-interference ability of the degree distribution function optimized by the probability transfer method is better. The BER of DNA-ICC scheme decreases with the decrease of error probability, which is stronger than other error correction codes. Compared with the original concatenated code, it saves at least 1.65 s, and has a good control effect on homopolymer. When the size of homopolymer exceeds 4 nt, the probability of homopolymer is only 0.44%. The proposed Quaternary dynamic Huffman code and concatenated error correction code have excellent performance.\n          <\/jats:p>","DOI":"10.1145\/3561823","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T14:12:00Z","timestamp":1663078320000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["DNA Computing-Based Multi-Source Data Storage Model in Digital Twins"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-1147","authenticated-orcid":false,"given":"Jinxia","family":"Wang","sequence":"first","affiliation":[{"name":"School of Art and Design, Shaanxi Fashion Engineering University, Xian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5292-3374","authenticated-orcid":false,"given":"Rui","family":"Chen","sequence":"additional","affiliation":[{"name":"Xi'an University of Posts &amp; Telecommunications, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2525-3074","authenticated-orcid":false,"given":"Zhihan","family":"Lv","sequence":"additional","affiliation":[{"name":"Department of Game Design, Faculty of Arts, Uppsala University, Visby, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,24]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2020.2971644"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2980036"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2021.3056351"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2970838"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3023826"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1817999"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIM.2021.9549127"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2998723"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2020.07.020"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3032444"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3005729"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2020.04.043"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3002611"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3049627"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3021700"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2020.2967908"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2021.100193"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2991461"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000343"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2019.10.001"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3005729"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.3389\/fpsyg.2018.02025"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2020.2971644"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3094876"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3012688"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2020.07.020"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2020.101225"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3108218"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102835"},{"issue":"1","key":"e_1_3_1_31_2","first-page":"38","article-title":"Deoxyribonucleic Acid (DNA) computing using Two-by-six complementary and color code cipher","volume":"2","author":"Adithya B.","year":"2021","unstructured":"B. Adithya and G. Santhi. 2021. Deoxyribonucleic Acid (DNA) computing using Two-by-six complementary and color code cipher. Bulletin of Computer Science and Electrical Engineering 2, 1 (2021), 38\u201345.","journal-title":"Bulletin of Computer Science and Electrical Engineering"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2020.0360"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3392665"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190838"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.82"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2021.3130228"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3081562"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.24191\/jmeche.v18i2.14943"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3440035"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561823","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:24Z","timestamp":1750186944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,24]]},"references-count":38,"journal-issue":{"issue":"3s","published-print":{"date-parts":[[2023,10,31]]}},"alternative-id":["10.1145\/3561823"],"URL":"https:\/\/doi.org\/10.1145\/3561823","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2023,2,24]]},"assertion":[{"value":"2022-01-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}