R&D: K-Means Multi-Verse Optimizer Algorithm to Construct DNA Storage Codes
Results can store information more efficiently over given length, increasing storage utilization.
This is a Press Release edited by StorageNewsletter.com on March 4, 2020 at 2:13 pmIEEE Access has published an article written by Ben Cao, Su-e Zhao, Xue Li, and Bin Wang, Key Laboratory of Advanced Design and Intelligent Computing, Ministry of Education, School of Software, Dalian University, Dalian, 116622, China.
Abstract: “In an era of information explosion, dealing with massive data has become a problem. Since DeoxyriboNucleic Acid (DNA) is a high-density storage medium with long storage endurance, a DNA based storage system is a viable solution. The first consideration of a DNA storage system is the DNA codes, which can avoid non-specific hybridization of DNA strands in the hybridization reaction process by using related constraints, such as Hamming distance constraints, GC-content constraints, and no-runlength constraints. A K-means Multi-Verse Optimizer (KMVO) algorithm is proposed to construct a better code boundary than the previous Multi-Verse Optimizer (MVO) algorithm that satisfies the above constraints. Our results can store information more efficiently over a given length, increasing storage utilization.“











