4.7 Article

FMG: An observable DNA storage coding method based on frequency matrix game graphs

Journal

COMPUTERS IN BIOLOGY AND MEDICINE
Volume 151, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compbiomed.2022.106269

Keywords

DNA storage; DNA coding; Frequency matrix game graph; High -quality coding; Coding constraint

Funding

  1. National Key Technology R & D Program of China [2018YFC0910500]
  2. National Natural Science Foundation of China [62272079, 61751203, 61972266, 61802040]
  3. LiaoNing Revitalization Talents Program [XLYC2008017]
  4. Innovation and Entrepreneurship Team of Dalian University [XQN202008]
  5. Natural Science Foundation of Liaoning Province [2021-MS-344, 2021-KF-11-03, 2022-KF-12-14]

Ask authors/readers for more resources

A new DNA storage coding method based on the frequency matrix game graph (FMG) is proposed in this study, which solves the problems of low efficiency and high complexity in current coding methods. The proposed method optimizes the coding results by observing visible characteristics. It has a positive impact on the development of carbon-based storage coding.
Using complex biomolecules for storage is a new carbon-based storage method. For example, DNA has the potential to be a good method for archival long-term data storage. Reasonable and efficient coding is the first and most important step in DNA storage. However, current coding methods, such as altruism algorithm, have the problem of low coding efficiency and high complexity, and coding constraints and sets make it difficult to see the coding results visually. In this study, a new DNA storage coding method based on frequency matrix game graph (FMG) is proposed to generate DNA storage coding satisfying combinatorial constraints. Compared with the randomness of the heuristic algorithm that satisfies the constraints, the coding method based on the FMG is deterministic and can clearly explain the coding process. In addition, the constraints and coding results have observable characteristics and are better than the previously published results for the size of the coding set. For example, when length of the code n = 10, hamming distance d = 4, the results obtained by proposed approach combining chaos game and graph are 24% better than the previous results. The proposed coding scheme successfully constructs high-quality coding sets with less complexity, which effectively promotes the development of carbon-based storage coding.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available