ArticleInternational journal of molecular sciences2020
An Intelligent Optimization Algorithm for Constructing a DNA Storage Code: NOL-HHO.
Article in International journal of molecular sciences, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
10 citing papers in PubMed.
- TC-HUR: A Tri-Phase Cauchy-Assisted Hunger Games Search and Unified Runge-Kutta Optimizer for Robust DNA Data Storage.International journal of molecular sciences · 2026Article
- Levy Sooty Tern Optimization Algorithm Builds DNA Storage Coding Sets for Random Access.Entropy (Basel, Switzerland) · 2024Article
- In-vitro validated methods for encoding digital data in deoxyribonucleic acid (DNA).BMC bioinformatics · 2023Review
- Study on DNA Storage Encoding Based IAOA under Innovation Constraints.Current issues in molecular biology · 2023Article
- Article
- Article
- CLGBO: An Algorithm for Constructing Highly Robust Coding Sets for DNA Storage.Frontiers in genetics · 2021Article
- Article
- Stable DNA Sequence Over Close-Ending and Pairing Sequences Constraint.Frontiers in genetics · 2021Article
- Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
The high density, large capacity, and long-term stability of DNA molecules make them an emerging storage medium that is especially suitable for the long-term storage of large datasets. The DNA sequences used in storage need to consider relevant constraints to avoid nonspecific hybridization reactions, such as the No-runlength constraint, GC-content, and the Hamming distance. In this work, a new nonlinear control parameter strategy and a random opposition-based learning strategy were used to improve the Harris hawks optimization algorithm (for the improved algorithm NOL-HHO) in order to prevent it from falling into local optima. Experimental testing was performed on 23 widely used benchmark functions, and the proposed algorithm was used to obtain better coding lower bounds for DNA storage. The results show that our algorithm can better maintain a smooth transition between exploration and exploitation and has stronger global exploration capabilities as compared with other algorithms. At the same time, the improvement of the lower bound directly affects the storage capacity and code rate, which promotes the further development of DNA storage technology.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.