Noise and Uncertainty in String-Duplication Systems
Abstract
Duplication mutations play a critical role in the generation of biological sequences. Simultaneously, they have a deleterious effect on data stored using in-vivo DNA data storage. While duplications have been studied both as a sequence-generation mechanism and in the context of error correction, for simplicity these studies have not taken into account the presence of other types of mutations. In this work, we consider the capacity of duplication mutations in the presence of point-mutation noise, and so quantify the generation power of these mutations. We show that if the number of point mutations is vanishingly small compared to the number of duplication mutations of a constant length, the generation capacity of these mutations is zero. However, if the number of point mutations increases to a constant fraction of the number of duplications, then the capacity is nonzero. Lower and upper bounds for this capacity are also presented. Another problem that we study is concerned with the mismatch between code design and channel in data storage in the DNA of living organisms with respect to duplication mutations. In this context, we consider the uncertainty of such a mismatched coding scheme measured as the maximum number of input codewords that can lead to the same output.
Additional Information
This work was supported in part by the NSF Expeditions in Computing Program (The Molecular Programming Project).Attached Files
Submitted - etr134.pdf
Files
Name | Size | Download all |
---|---|---|
md5:a1935ea6f097c462556a0f38c5ab6832
|
173.0 kB | Preview Download |
Additional details
- Eprint ID
- 73557
- Resolver ID
- CaltechAUTHORS:20170119-133807104
- NSF
- Created
-
2017-01-19Created from EPrint's datestamp field
- Updated
-
2021-08-18Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group
- Other Numbering System Name
- PARADISE
- Other Numbering System Identifier
- etr134