Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this is called trace reconstruction. One can reduce the error rate further by introducing redundancy in write sequence and this is called coded trace reconstruction. In this paper, we model the DNA storage channel as an insertion-deletion-substitution (IDS) channel and design both encoding schemes and low-complexity decoding algorithms for coded trace reconstruction. We introduce Trellis BMA, a new reconstruction algorithm whose complexity is linear in the number of traces, and compare its performance to previous algorithms. Our results show that it reduces the error rate on both simulated and experimental data. The performance comparisons in this paper are based on the Clustered Nanopore Reads Dataset publicly released with this paper. Our hope is that this dataset will enable research progress by allowing objective comparisons between candidate algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Random access in large-scale DNA data storage
Organick, L., Ang, S. D., Chen, Y.-J., Lopez, R., Yekhanin, S., Makarychev, K., Racz, M. Z., Kamath, G., Gopalan, P., Nguyen, B., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4079 · Cited by 775
Self-citationRobust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754
DNA-Based Storage: Trends and Methods
Yazdi, S. M. H. T., Kiah, H. M., Garcia-Ruiz, E., Ma, J., Zhao, H., & Milenkovic, O. (2015) · IEEE Transactions on Molecular, Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2016.2537305 · Cited by 278
Antkowiak, P. L., Lietard, J., Darestani, M. Z., Somoza, M. M., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Communications · doi:10.1038/s41467-020-19148-3 · Cited by 173
DNA assembly for nanopore data storage readout
Lopez, R., Chen, Y.-J., Dumas Ang, S., Yekhanin, S., Makarychev, K., Racz, M. Z., Seelig, G., Strauss, K., & Ceze, L. (2019) · Nature Communications · doi:10.1038/s41467-019-10978-4 · Cited by 142
Self-citationFundamental limits of DNA storage systems
Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007106 · Cited by 123
Cheraghchi, M., Gabrys, R., Milenkovic, O., & Ribeiro, J. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2996377 · Cited by 90
Cited by
Scaling DNA data storage with nanoscale electrode wells
Nguyen, B. H., Takahashi, C. N., Gupta, G., Smith, J. A., Rouse, R., Berndt, P., Yekhanin, S., Ward, D. P., Ang, S. D., Garvan, P., et al. (2021) · Science Advances · doi:10.1126/sciadv.abi6714 · Cited by 90
Self-citationXie, R., Zan, X., Chu, L., Su, Y., Xu, P., & Liu, W. (2023) · BMC Bioinformatics · doi:10.1186/s12859-023-05237-9 · Cited by 32
A robust and efficient DNA storage architecture based on modulation encoding and decoding
Zan, X., Xie, R., Yao, X., Xu, P., & Liu, W. (2022) · doi:10.1101/2022.05.25.490755 · Cited by 27
Rebimbas, R., Glória, I., Chegão, J., Al-Rawi, M., Mousakhani Ganjeh, A., & Saraiva, J. A. (2026) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2026.03.003
Metadata
- Authors
- Srinivasavaradhan, S. R., Gopi, S., Pfister, H. D., & Yekhanin, S.
- Venue
- 2021 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2021-07-12
- Pages
- 2453-2458
- OpenAlex
- W3159986226
- Cited by
- 75
- References
- 8
- FWCI
- 46.54
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. https://app.cochat.ai/papers/10.1109/isit45174.2021.9517821
- The paper
- Srinivasavaradhan, S. R., Gopi, S., Pfister, H. D., & Yekhanin, S. (2021). Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. 2021 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit45174.2021.9517821
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.