Abstract
The exponential increase of big data volumes demands a large capacity and high-density storage. Deoxyribonucleic acid (DNA) has recently emerged as a new research trend for data storage in various studies due to its high capacity and durability, where primers and address sequences played a vital role. However, it is a critical biocomputing task to design DNA strands without errors. In the DNA synthesis and sequencing process, each nucleotide is repeated, which is prone to errors during the hybridization reactions. It decreases the lower bounds of DNA coding sets which causes the data storage stability. This study proposes a metaheuristic algorithm to improve the lower bounds of DNA data storage. The proposed algorithm is inspired by a moth-flame optimizer (MFO), which has exploration and exploitation capability in one dimension, and it is enhanced by opposition-based learning (OBL) strategy with three-dimension search space for the optimal solution; hereafter, it is MFOL algorithm. This algorithm is programmed to construct the DNA storage codes by reducing the error rates of DNA coding sets with GC-content, Hamming distance, and No-runlength constraints. In experiments, 13 benchmark functions and Wilcoxon rank-sum test are implemented, and performances are compared with the original MFO and three other algorithms. The generated DNA codewords by MFOL are compared with a state-of-the-art Altruistic algorithm and KMVO algorithm. The proposed algorithm improved 30% DNA coding rates with shorter sequences, reducing errors during DNA synthesis and sequencing.
Supported by The National Key Research and Development Program of China under grant number 2020YFA0909100.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
David Reinsel, J.G.: John Rydning, Data Age 2025: The Digitization of the World From Edge to Core, in An IDC White Paper. IDC, November 2018
Erlich, Y., Zielinski, D.: DNA fountain enables a robust and efficient storage architecture. Science 355(6328), 950–953 (2017)
Bornholt, J., et al.: Toward a DNA-based archival storage system. IEEE Micro 37(3), 98–104 (2017)
Church, G.M., Gao, Y., Kosuri, S.: Next-generation digital information storage in DNA. Science 337(6102), 1628–1628 (2012)
Goldman, N., et al.: Towards practical, high-capacity, low-maintenance information storage in synthesized DNA. Nature 494(7435), 77–80 (2013)
Li, M., et al.: A self-contained and self-explanatory DNA storage system. Sci. Rep. 11(1), 18063 (2021)
Song, W., et al.: Codes with run-length and GC-content constraints for DNA-based data storage. IEEE Commun. Lett. 22(10), 2004–2007 (2018)
Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228–249 (2015)
Emary, E., et al.: Firefly optimization algorithm for feature selection. In: Proceedings of the 7th Balkan Conference on Informatics Conference, Association for Computing Machinery: Craiova, Romania. p. Article 26 (2015)
Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46–61 (2014)
Heidari, A.A., et al.: Harris hawks optimization: algorithm and applications. Future Gener. Comput. Syst. 97, 849–872 (2019)
Mirjalili, S., Mirjalili, S.M., Hatamlou, A.: Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput. Appl. 27(2), 495–513 (2015). https://doi.org/10.1007/s00521-015-1870-7
Cao, B., et al.: K-means multi-verse optimizer (KMVO) algorithm to construct DNA storage codes. IEEE Access 8, 29547–29556 (2020)
Limbachiya, D., Gupta, M.K., Aggarwal, V.: Family of constrained codes for archival DNA data storage. IEEE Commun. Letters 22(10), 1972–1975 (2018)
Aboluion, N., Smith, D.H., Perkins, S.: Linear and nonlinear constructions of DNA codes with hamming distance d, constant GC-content and a reverse-complement constraint. Discrete Math. 312(5), 1062–1075 (2012)
Abualigah, L., et al.: The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 376, 113609 (2021)
Tizhoosh, H.R.: Opposition-based learning: a new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC 2006) (2005)
Rasool, A., et al.: GAWA-a feature selection method for hybrid sentiment classification. IEEE Access 8, 191850–191861 (2020)
Kim, D.H., Kim, Y.C.: Wilcoxon signed rank test using ranked-set sample. Korean J. Comput. Appl. Math. 3(2), 235–243 (1996)
Chee, Y.M., Ling, S.: Improved lower bounds for constant GC-content DNA codes. IEEE Trans. Inf. Theory 54, 391–394 (2008)
Sager, J., Stefanovic, D.: Designing nucleotide sequences for computation: a survey of constraints. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 275–289. Springer, Heidelberg (2006). https://doi.org/10.1007/11753681_22
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Rasool, A., Qu, Q., Jiang, Q., Wang, Y. (2022). A Strategy-based Optimization Algorithm to Design Codes for DNA Data Storage System. In: Lai, Y., Wang, T., Jiang, M., Xu, G., Liang, W., Castiglione, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2021. Lecture Notes in Computer Science(), vol 13156. Springer, Cham. https://doi.org/10.1007/978-3-030-95388-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-95388-1_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95387-4
Online ISBN: 978-3-030-95388-1
eBook Packages: Computer ScienceComputer Science (R0)