R&D: Design of Constraint Coding Sets for Archive DNA Storage

IEEE/ACM Transactions on Computational Biology and Bioinformatics has published an article written by Qiang Yin, Yanfen Zheng, Bin Wang, dalian university, Dalian, Liaoning, China, and Qiang Zhang, School of Computer Science and Technology, Dalian University of Technology, 12399 Dalian, Liaoning, China, 116024.

Abstract: “With the advent of the era of massive data, the increase of storage demand has far exceeded current storage capacity. DNA molecules provide a reliable solution for big data storage by virtue of their large capacity, high density, and long-term stability. To reduce errors in storing procedures, constructing a sufficient set of constraint encoding is critical for achieving DNA storage. A new version of the Marine Predator algorithm (called QRSS-MPA) is proposed in this paper to increase the lower limit of the coding set while satisfying the specific combination of constraints. In order to demonstrate the effectiveness of the improvement, the classical CEC-05 test function is used to test and compare the mean, variance, scalability, and significance. In terms of storage, the lower limit of construction is compared with previous works, and the result is found to be significantly improved. In order to prevent the emergence of a secondary structure that leads to sequencing failure, we give a more stringent lower bound for the constraint coding set, which is of great significance for reducing the error rate of DNA storage amidst its rapid development.“