RECORD
Error-Correcting Codes for Combinatorial Composite DNA
Information Theory · Submitted 28 Jan 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In this paper, we model this type of error as a type of asymmetric error and propose code constructions that can correct such errors in this setup.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Data storage in DNA is developing as a possible solution for archival digital data. Recently, to further increase the potential capacity of DNA-based data storage systems, the combinatorial composite DNA synthesis method was suggested. This approach extends the DNA alphabet by harnessing short DNA fragment reagents, known as shortmers. The shortmers are building blocks of the alphabet symbols, consisting of a fixed number of shortmers. Thus, when information is read, it is possible that one of the shortmers that forms part of the composition of a symbol is missing and therefore the symbol cannot be determined. In this paper, we model this type of error as a type of asymmetric error and propose code constructions that can correct such errors in this setup. We also provide a lower bound on the redundancy of such error-correcting codes and give an explicit encoder and decoder pair for our construction. Our suggested error model is also supported by an analysis of data from actual experiments that produced DNA according to the combinatorial scheme. Lastly, we also provide a statistical evaluation of the probability of observing such error events, as a function of read depth.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Data storage in DNA is developing as a possible solution for archival digital data. | background 1.00 | 0.04 | 0.02 | hedged possibility 0.76 |
| s1 | Recently, to further increase the potential capacity of DNA-based data storage systems, the combinatorial composite DNA synthesis method was suggested. | background 1.00 | 0.05 | 0.03 | asserted 0.80 |
| s2 | This approach extends the DNA alphabet by harnessing short DNA fragment reagents, known as shortmers. | background 0.94 | 0.08 | 0.02 | asserted 1.00 |
| s3 | The shortmers are building blocks of the alphabet symbols, consisting of a fixed number of shortmers. | background 0.97 | 0.09 | 0.02 | asserted 1.00 |
| s4 | Thus, when information is read, it is possible that one of the shortmers that forms part of the composition of a symbol is missing and therefore the symbol cannot be determined. | background 0.98 | 0.08 | 0.02 | hedged possibility 0.97 |
| s5 | In this paper, we model this type of error as a type of asymmetric error and propose code constructions that can correct such errors in this setup. | contribution 0.96 | 0.95 | 0.40 | asserted 1.00 |
| s6 | We also provide a lower bound on the redundancy of such error-correcting codes and give an explicit encoder and decoder pair for our construction. | contribution 0.96 | 0.96 | 0.27 | asserted 1.00 |
| s7 | Our suggested error model is also supported by an analysis of data from actual experiments that produced DNA according to the combinatorial scheme. | contribution 0.44 | 0.87 | 0.06 | asserted 0.93 |
| s8 | Lastly, we also provide a statistical evaluation of the probability of observing such error events, as a function of read depth. | contribution 0.72 | 0.93 | 0.07 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Data storage in DNA is developing as a possible solution for archival digital data. Recently, to further increase the potential capacity of DNA-based data storage systems, the combinatorial composite DNA synthesis method was suggested. This approach extends the DNA alphabet by harnessing short DNA fragment reagents, known as shortmers. The shortmers are building blocks of the alphabet symbols, consisting of a fixed number of shortmers. Thus, when information is read, it is possible that one of the shortmers that forms part of the composition of a symbol is missing and therefore the symbol cannot be determined. In this paper, we model this type of error as a type of asymmetric error and propose code constructions that can correct such errors in this setup. We also provide a lower bound on the redundancy of such error-correcting codes and give an explicit encoder and decoder pair for our construction. Our suggested error model is also supported by an analysis of data from actual experiments that produced DNA according to the combinatorial scheme. Lastly, we also provide a statistical evaluation of the probability of observing such error events, as a function of read depth.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites
Cites as background 1 paper
-
In the last decade, there has been notable progress in DNA storage systems, where the stability and density of DNA molecules are utilized to create robust and high-capacity data storage platforms [ref] .
Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning · Introduction · 1.00
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.