Code design for random-access in DNA-based storage system
Recently, DNA-based data storage has attracted much attention due to its inherent extreme information density and preservation longevity. However, it exists with its challenges that impede its practical usage. The primer design is able to address these challenges while posing another problem which i...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/141704 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | Recently, DNA-based data storage has attracted much attention due to its inherent extreme information density and preservation longevity. However, it exists with its challenges that impede its practical usage. The primer design is able to address these challenges while posing another problem which is combinatorial constraints. For example, the similarity among codewords (or their complementary pairs) should be lower to control the undesired cross-hybridizations. Meanwhile, the codewords should satisfy certain biochemical constraints, i.e., balanced GC content, hairpin limit. In this project, the student will study the features of a DNA-based storage system and design a code to be used as the primers for implementing random-access in DNA data storage. |
|---|