Back to Search
Start Over
Reconstruction algorithms for DNA-storage systems.
- Source :
-
Scientific reports [Sci Rep] 2024 Jan 23; Vol. 14 (1), pp. 1951. Date of Electronic Publication: 2024 Jan 23. - Publication Year :
- 2024
-
Abstract
- Motivated by DNA storage systems, this work presents the DNA reconstruction problem, in which a length-n string, is passing through the DNA-storage channel, which introduces deletion, insertion and substitution errors. This channel generates multiple noisy copies of the transmitted string which are called traces. A DNA reconstruction algorithm is a mapping which receives t traces as an input and produces an estimation of the original string. The goal in the DNA reconstruction problem is to minimize the edit distance between the original string and the algorithm's estimation. In this work, we present several new algorithms for this problem. Our algorithms look globally on the entire sequence of the traces and use dynamic programming algorithms, which are used for the shortest common supersequence and the longest common subsequence problems, in order to decode the original string. Our algorithms do not require any limitations on the input and the number of traces, and more than that, they perform well even for error probabilities as high as 0.27. The algorithms have been tested on simulated data, on data from previous DNA storage experiments, and on a new synthesized dataset, and are shown to outperform previous algorithms in reconstruction accuracy.<br /> (© 2024. The Author(s).)
- Subjects :
- Motivation
Probability
Records
Algorithms
DNA
Subjects
Details
- Language :
- English
- ISSN :
- 2045-2322
- Volume :
- 14
- Issue :
- 1
- Database :
- MEDLINE
- Journal :
- Scientific reports
- Publication Type :
- Academic Journal
- Accession number :
- 38263421
- Full Text :
- https://doi.org/10.1038/s41598-024-51730-3