{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:16Z","timestamp":1773377896739,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518236","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2465-2470","source":"Crossref","is-referenced-by-count":27,"title":["On Coding for an Abstracted Nanopore Channel for DNA Storage"],"prefix":"10.1109","author":[{"given":"Reyna","family":"Hulett","sequence":"first","affiliation":[{"name":"Stanford University,Stanford,CA,94305"}]},{"given":"Shubham","family":"Chandak","sequence":"additional","affiliation":[{"name":"Stanford University,Stanford,CA,94305"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Stanford University,Stanford,CA,94305"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"The Oxford Nanopore MinION: delivery of nanopore sequencing to the genomics community","volume":"17","author":"jain","year":"2016","journal-title":"Genome Biology"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1727-y"},{"key":"ref12","year":"0","journal-title":"Flappie Flip-flop basecaller for Oxford Nanopore reads"},{"key":"ref13","year":"0","journal-title":"Scrappie A technology demonstrator for the Oxford Nanopore Research Algorithms group"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849596"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA Fountain enables a robust and efficient storage architecture","volume":"355","author":"erlich","year":"2017","journal-title":"Science"},{"key":"ref27","article-title":"The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages","volume":"abs 907 159","author":"rampersad","year":"2009","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10978-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10258-1"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"goldman","year":"2013","journal-title":"Nature"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053441"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s10038-019-0655-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2630056"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"ref23","author":"marcus","year":"2001","journal-title":"An introduction to coding for constrained systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518236.pdf?arnumber=9518236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:30Z","timestamp":1773347730000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518236\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518236","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}