Year: 2026
Type: dissertation
Abstract: The exponential growth of digital data has created an increasing demand for high-density and durable storage media. DNA-based storage systems emerge as a promising solution due to their unprecedented information density and long-term stability; however, mainstream adoption is limited by the efficiency of data retrieval, especially in random access settings, where single strands must be recovered through repeated sequencing. In response to this challenge, the thesis studies the random-access problem in DNA storage, which aims to minimize the number of sequenced strands for efficient data retrieval. For this purpose, the fundamentals of DNA data storage and its coding-theoretic foundation were introduced, which highlighted the importance of combinatorial structures in improving the performance of a storage system. Subsequently, formulae for computing the variance of the number of sequenced strands were derived. In addition, expressions for the expected value and variance of total retrieving time when applying systematic MDS codes were obtained and interpreted.
Source: Aaltodoc (Aalto University)
Author: Tran, Nam
Institution: Aalto University
Language: English
Topic: DNA and Biological Computing
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7161369331
