{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T01:48:59Z","timestamp":1782870539826,"version":"3.54.5"},"reference-count":42,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004921","name":"Shanghai Jiao Tong University","doi-asserted-by":"publisher","award":["24X010301456"],"award-info":[{"award-number":["24X010301456"]}],"id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023B1515120006"],"award-info":[{"award-number":["2023B1515120006"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["NRFI09-0015"],"award-info":[{"award-number":["NRFI09-0015"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["2022ZD0212400"],"award-info":[{"award-number":["2022ZD0212400"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["24510714300"],"award-info":[{"award-number":["24510714300"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["20DZ2254400"],"award-info":[{"award-number":["20DZ2254400"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["cell.com","elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["iScience"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.isci.2025.113791","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:38:28Z","timestamp":1761129508000},"page":"113791","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient trace reconstruction in DNA storage systems using bidirectional beam search"],"prefix":"10.1016","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6811-6499","authenticated-orcid":false,"given":"Zhenhao","family":"Gu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyi","family":"Xin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Puru","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gary Yipeng","family":"Goh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Limsoon","family":"Wong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niranjan","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.isci.2025.113791_bib1","series-title":"Proceedings of the twenty-first international conference on architectural support for programming languages and operating systems","first-page":"637","article-title":"A dna-based archival storage system","author":"Bornholt","year":"2016"},{"key":"10.1016\/j.isci.2025.113791_bib2","doi-asserted-by":"crossref","first-page":"17552","DOI":"10.1021\/acsnano.2c06748","article-title":"Emerging approaches to dna data storage: challenges and prospects","volume":"16","author":"Doricchi","year":"2022","journal-title":"ACS Nano"},{"key":"10.1016\/j.isci.2025.113791_bib3","doi-asserted-by":"crossref","first-page":"4463","DOI":"10.1039\/D3CS00469D","article-title":"High-throughput dna synthesis for data storage","volume":"53","author":"Yu","year":"2024","journal-title":"Chem. Soc. Rev."},{"key":"10.1016\/j.isci.2025.113791_bib4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000117","article-title":"Information-theoretic foundations of dna data storage","volume":"19","author":"Shomorony","year":"2022","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"10.1016\/j.isci.2025.113791_bib5","first-page":"593","article-title":"Reconstruction of objects from the minimum number of distorted patterns","volume":"354","author":"Levenshtein","year":"1997","journal-title":"Dokl. Akad. Nauk"},{"key":"10.1016\/j.isci.2025.113791_bib6","series-title":"ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","first-page":"8822","article-title":"Overcoming high nanopore basecaller error rates for dna storage via basecaller-decoder integration and convolutional codes","author":"Chandak","year":"2020"},{"key":"10.1016\/j.isci.2025.113791_bib7","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1038\/s41587-021-01108-x","article-title":"Nanopore sequencing technology, bioinformatics and applications","volume":"39","author":"Wang","year":"2021","journal-title":"Nat. Biotechnol."},{"key":"10.1016\/j.isci.2025.113791_bib8","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1021\/nl1012147","article-title":"Optical recognition of converted dna nucleotides for single-molecule dna sequencing using nanopore arrays","volume":"10","author":"McNally","year":"2010","journal-title":"Nano Lett."},{"key":"10.1016\/j.isci.2025.113791_bib9","author":"Illumina"},{"key":"10.1016\/j.isci.2025.113791_bib10","author":"Illumina"},{"key":"10.1016\/j.isci.2025.113791_bib11","article-title":"Adaptive sampling in nanopore sequencing for pcr-free random access in dna data storage","author":"Sokolovskii","year":"2024","journal-title":"bioRxiv"},{"key":"10.1016\/j.isci.2025.113791_bib12","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0257521","article-title":"Sequencing dna with nanopores: Troubles and biases","volume":"16","author":"Delahaye","year":"2021","journal-title":"PLoS One"},{"key":"10.1016\/j.isci.2025.113791_bib13","doi-asserted-by":"crossref","first-page":"5345","DOI":"10.1038\/s41467-020-19148-3","article-title":"Low cost dna data storage using photolithographic synthesis and advanced information reconstruction and error correction","volume":"11","author":"Antkowiak","year":"2020","journal-title":"Nat. Commun."},{"key":"10.1016\/j.isci.2025.113791_bib14","article-title":"Clustering billions of reads for dna data storage","volume":"30","author":"Rashtchian","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.isci.2025.113791_bib15","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1093\/nar\/gkh340","article-title":"Muscle: multiple sequence alignment with high accuracy and high throughput","volume":"32","author":"Edgar","year":"2004","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.isci.2025.113791_bib16","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1093\/nar\/gkf436","article-title":"Mafft: a novel method for rapid multiple sequence alignment based on fast fourier transform","volume":"30","author":"Katoh","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.isci.2025.113791_bib17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1186\/s12859-023-05237-9","article-title":"Study of the error correction capability of multiple sequence alignment algorithm (mafft) in dna storage","volume":"24","author":"Xie","year":"2023","journal-title":"BMC Bioinf."},{"key":"10.1016\/j.isci.2025.113791_bib18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1186\/s13059-023-02903-2","article-title":"Comprehensive benchmark and architectural analysis of deep learning models for nanopore sequencing basecalling","volume":"24","author":"Pag\u00e8s-Gallego","year":"2023","journal-title":"Genome Biol."},{"key":"10.1016\/j.isci.2025.113791_bib19","series-title":"2021 IEEE International Symposium on Information Theory (ISIT)","first-page":"2453","article-title":"Trellis bma: Coded trace reconstruction on ids channels for dna storage","author":"Srinivasavaradhan","year":"2021"},{"key":"10.1016\/j.isci.2025.113791_bib20","doi-asserted-by":"crossref","first-page":"3295","DOI":"10.1109\/TIT.2020.3030569","article-title":"Trace reconstruction problems in computational biology","volume":"67","author":"Bhardwaj","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.isci.2025.113791_bib21","first-page":"910","article-title":"Reconstructing strings from random traces","volume":"4","author":"Batu","year":"2004","journal-title":"SODA"},{"key":"10.1016\/j.isci.2025.113791_bib22","article-title":"Trace reconstruction from noisy polynucleotide sequencer reads","author":"Gopalan","year":"2018","journal-title":"US Patent App. 15\/536,115"},{"key":"10.1016\/j.isci.2025.113791_bib23","series-title":"Proceedings of the 49th Annual International Symposium on Computer Architecture","first-page":"482","article-title":"Managing reliability skew in dna storage","author":"Lin","year":"2022"},{"key":"10.1016\/j.isci.2025.113791_bib24","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1038\/nbt.4079","article-title":"Random access in large-scale dna data storage","volume":"36","author":"Organick","year":"2018","journal-title":"Nat. Biotechnol."},{"key":"10.1016\/j.isci.2025.113791_bib25","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1186\/s13059-019-1659-6","article-title":"Analysis of error profiles in deep next-generation sequencing data","volume":"20","author":"Ma","year":"2019","journal-title":"Genome Biol."},{"key":"10.1016\/j.isci.2025.113791_bib26","doi-asserted-by":"crossref","first-page":"5361","DOI":"10.1038\/s41467-022-33046-w","article-title":"Robust data storage in dna by de bruijn graph-based de novo strand assembly","volume":"13","author":"Song","year":"2022","journal-title":"Nat. Commun."},{"key":"10.1016\/j.isci.2025.113791_bib27","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1038\/s41598-024-51730-3","article-title":"Reconstruction algorithms for dna-storage systems","volume":"14","author":"Sabary","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.isci.2025.113791_bib28","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1016\/j.csbj.2024.02.019","article-title":"Robust multi-read reconstruction from noisy clusters using deep neural network for dna storage","volume":"23","author":"Qin","year":"2024","journal-title":"Comput. Struct. Biotechnol. J."},{"key":"10.1016\/j.isci.2025.113791_bib29","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-024-83806-5","article-title":"A generative adversarial network for multiple reads reconstruction in dna storage","volume":"14","author":"Zheng","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.isci.2025.113791_bib30","article-title":"Single-read reconstruction for dna data storage using transformers","author":"Nahum","year":"2021","journal-title":"arXiv"},{"key":"10.1016\/j.isci.2025.113791_bib31","doi-asserted-by":"crossref","first-page":"6968","DOI":"10.1038\/s41467-022-34630-w","article-title":"Muscle5: High-accuracy alignment ensembles enable unbiased assessments of sequence homology and phylogeny","volume":"13","author":"Edgar","year":"2022","journal-title":"Nat. Commun."},{"key":"10.1016\/j.isci.2025.113791_bib32","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1038\/s42256-025-01003-z","article-title":"Scalable and robust dna-based storage via coding theory and deep learning","volume":"7","author":"Bar-Lev","year":"2025","journal-title":"Nat. Mach. Intell."},{"key":"10.1016\/j.isci.2025.113791_bib33","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","article-title":"Forward error correction for dna data storage","volume":"80","author":"Blawat","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.isci.2025.113791_bib34","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MBITS.2023.3318516","article-title":"Error correction for dna storage","volume":"3","author":"Sima","year":"2023","journal-title":"IEEE BITS Inform. Theory Mag."},{"key":"10.1016\/j.isci.2025.113791_bib35","article-title":"New lower bounds for trace reconstruction","author":"Chase","year":"2021","journal-title":"arXiv"},{"key":"10.1016\/j.isci.2025.113791_bib36","series-title":"2024 IEEE International Symposium on Information Theory (ISIT)","first-page":"879","article-title":"On k-mer-based and maximum likelihood estimation algorithms for trace reconstruction","author":"Cheng","year":"2024"},{"key":"10.1016\/j.isci.2025.113791_bib37","series-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"1047","article-title":"Optimal mean-based algorithms for trace reconstruction","author":"De","year":"2017"},{"key":"10.1016\/j.isci.2025.113791_bib38","series-title":"Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"Holenstein","year":"2008"},{"key":"10.1016\/j.isci.2025.113791_bib39","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jcta.2000.3081","article-title":"Efficient reconstruction of sequences from their subsequences or supersequences","volume":"93","author":"Levenshtein","year":"2001","journal-title":"J. Combin. Theor."},{"key":"10.1016\/j.isci.2025.113791_bib40","series-title":"Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"Viswanathan","year":"2008"},{"key":"10.1016\/j.isci.2025.113791_bib41","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","article-title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","volume":"13","author":"Viterbi","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.isci.2025.113791_bib42","first-page":"321","article-title":"Algorithm 65: find","volume":"4","author":"Hoare","year":"1961","journal-title":"Commun. ACM"}],"container-title":["iScience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2589004225020528?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2589004225020528?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T01:25:04Z","timestamp":1782869104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2589004225020528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["S2589004225020528"],"URL":"https:\/\/doi.org\/10.1016\/j.isci.2025.113791","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2025.04.16.644694","asserted-by":"object"}]},"ISSN":["2589-0042"],"issn-type":[{"value":"2589-0042","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient trace reconstruction in DNA storage systems using bidirectional beam search","name":"articletitle","label":"Article Title"},{"value":"iScience","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.isci.2025.113791","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"113791"}}