Robust data storage in DNA by de Bruijn graph-based de novo strand assembly.
Nat Commun
; 13(1): 5361, 2022 09 12.
Article
en En
| MEDLINE
| ID: mdl-36097016
ABSTRACT
DNA data storage is a rapidly developing technology with great potential due to its high density, long-term durability, and low maintenance cost. The major technical challenges include various errors, such as strand breaks, rearrangements, and indels that frequently arise during DNA synthesis, amplification, sequencing, and preservation. In this study, a de novo strand assembly algorithm (DBGPS) is developed using de Bruijn graph and greedy path search to meet these challenges. DBGPS shows substantial advantages in handling DNA breaks, rearrangements, and indels. The robustness of DBGPS is demonstrated by accelerated aging, multiple independent data retrievals, deep error-prone PCR, and large-scale simulations. Remarkably, 6.8 MB of data is accurately recovered from a severely corrupted sample that has been treated at 70 °C for 70 days. With DBGPS, we are able to achieve a logical density of 1.30 bits/cycle and a physical density of 295 PB/g.
Texto completo:
1
Bases de datos:
MEDLINE
Asunto principal:
Almacenamiento y Recuperación de la Información
/
Secuenciación de Nucleótidos de Alto Rendimiento
Idioma:
En
Revista:
Nat Commun
Asunto de la revista:
BIOLOGIA
/
CIENCIA
Año:
2022
Tipo del documento:
Article
País de afiliación:
China