{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:20:35Z","timestamp":1784136035237,"version":"3.55.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T00:00:00Z","timestamp":1700179200000},"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 Comput. Surv."],"published-print":{"date-parts":[[2024,4,30]]},"abstract":"<jats:p>The yearly global production of data is growing exponentially, outpacing the capacity of existing storage media, such as tape and disk, and surpassing our ability to store it. DNA storage\u2014the representation of arbitrary information as sequences of nucleotides\u2014offers a promising storage medium. DNA is nature\u2019s information-storage molecule of choice and has a number of key properties: It is extremely dense, offering the theoretical possibility of storing 455 EB\/g; it is durable, with a half-life of approximately 520 years that can be increased to thousands of years when DNA is chilled and stored dry; and it is amenable to automated synthesis and sequencing. Furthermore, biochemical processes that act on DNA potentially enable highly parallel data manipulation.<\/jats:p>\n          <jats:p>While biological information is encoded in DNA via a specific mapping from triplet sequences of nucleotides to amino acids, DNA storage is not limited to a single encoding scheme, and there are many possible ways to map data to chemical sequences of nucleotides for synthesis, storage, retrieval, and data manipulation. However, there are several biological, error-tolerance, and information-retrieval considerations that an encoding scheme needs to address to be viable.<\/jats:p>\n          <jats:p>This comprehensive review focuses on comparing existing work done in encoding arbitrary data within DNA in terms of their encoding schemes, methods to address biological constraints, and measures to provide error correction. We compare encoding approaches on the overall information density and coverage they achieve, as well as the data-retrieval method they use (i.e., sequential or random access). We also discuss the background and evolution of the encoding schemes.<\/jats:p>","DOI":"10.1145\/3626233","type":"journal-article","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T16:00:30Z","timestamp":1696435230000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Survey of Information Encoding Techniques for DNA"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7470-2123","authenticated-orcid":false,"given":"Thomas","family":"Heinis","sequence":"first","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3156-5923","authenticated-orcid":false,"given":"Roman","family":"Sokolovskii","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8164-4753","authenticated-orcid":false,"given":"Jamie J.","family":"Alnasir","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,17]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2014. Keyboard scan codes. Retrieved June 20 2019 from https:\/\/www.marjorie.de\/ps2\/scancode-set2.htm"},{"key":"e_1_3_2_3_2","unstructured":"2021. TPC-H Decision Support Benchmark. Retrieved April 14 2021 from http:\/\/www.tpc.org\/tpch\/"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.2144\/000113218"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1098\/rspb.2012.1745"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_7_2","volume-title":"Proceedings of the 9th Biennial Conference on Innovative Data Systems Research CIDR","author":"Appuswamy Raja","year":"2019","unstructured":"Raja Appuswamy, Kevin Le. Brigand, Pascal Barbry, Marc Antonini, Olivier Madderson, Paul Freemont, James McDonald, and Thomas Heinis. 2019. OligoArchive: Using DNA in the DBMS storage hierarchy. In Proceedings of the 9th Biennial Conference on Innovative Data Systems Research CIDR. http:\/\/cidrdb.org\/cidr2019\/papers\/p98-appuswamy-cidr19.pdf"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41563-021-01021-3"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.293.5536.1763c"},{"key":"e_1_3_2_11_2","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201904)","author":"Batu Tuundefinedkan","year":"2004","unstructured":"Tuundefinedkan Batu, Sampath Kannan, Sanjeev Khanna, and Andrew McGregor. 2004. Reconstructing strings from random traces. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201904)."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919890"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16958-3"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1038\/21092"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7799(01)01671-7"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1080\/00043249.1996.10791743"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.23919\/Eusipco47968.2020.9287470"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkn425"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1093\/nsr\/nwaa007"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_3_2_27_2","unstructured":"Charlotte Jarvis. 2012. Blighted by Kenning. Retrieved October 14 2022 from https:\/\/cjarvis.com\/blighted-by-kenning\/"},{"key":"e_1_3_2_28_2","unstructured":"Eduardo Kac. 1999. GENESIS. Retrieved June 20 2019 from http:\/\/www.ekac.org\/geninfo.html"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16797-2"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1021\/la703235y"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2004821117"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024539608706"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13036-019-0211-2"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/602421.602426"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1021\/bp060261y"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626233","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:47Z","timestamp":1750291547000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,17]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4,30]]}},"alternative-id":["10.1145\/3626233"],"URL":"https:\/\/doi.org\/10.1145\/3626233","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,17]]},"assertion":[{"value":"2021-07-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}