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 · 2026
DOI: 10.3390/ijms27073134 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Molecular Sciences, 2026. Verfasst von Beyza Öztürk und 5 weiteren Autor:innen. Beteiligte Einrichtung: Department of Electrical-Electronics Engineering, Faculty of Engineering and Natural Sciences, Istanbul Atlas University, 34408 Istanbul, Türkiye. Hauptthemen laut MEDLINE: Algorithms, DNA, Information Storage and Retrieval, Computational Biology. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Although DNA-based data storage theoretically provides an information density of 2 bits per nucleotide, biochemical constraints transform sequence design into a high-dimensional constrained combinatorial optimization problem. The high computational cost and low encoding efficiency of conventional rule-based approaches make metaheuristic methods an effective alternative. This study proposes the TC-HUR hybrid algorithm to simultaneously optimize information density and conflicting biophysical constraints, including homopolymer (HP) length, GC content, melting temperature (Tm), and reverse-complement (RC) similarity. The method escapes local optima using Cauchy jump-enhanced Hunger Games Search (HGS), performs high-precision exploitation via Runge–Kutta (RUN) operators, and refines constraint violations at the nucleotide level through an adaptive intensive mutation mechanism. The algorithm is evaluated on a complex dataset of 1853 nucleotides under different noise regimes. TC-HUR outperforms RUN by 2.5% and HGS by 16.7% in average fitness. While maintaining homopolymer length near the ideal threshold, it reduces reverse-complement similarity to 19.10%, ensuring high sequence diversity. Under high-noise conditions, TC-HUR achieves a normalized edit distance of 0.1290, reducing insertion–deletion (indel) errors by approximately 14%. The results demonstrate that the proposed model effectively generates biophysically synthesizable and noise-resilient DNA codes.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Substanzen
Autor:innen und Institutionen
- Department of Electrical-Electronics Engineering, Faculty of Engineering and Natural Sciences, Istanbul Atlas University, 34408 Istanbul, Türkiye.
- Department of Software Engineering, Faculty of Engineering and Natural Sciences, Istanbul Atlas University, 34408 Istanbul, Türkiye.
- Department of Molecular Biology and Genetics, Faculty of Engineering and Natural Sciences, Istanbul Atlas University, 34408 Istanbul, Türkiye.
- Department of Computer Engineering, Faculty of Engineering and Natural Sciences, Istanbul Atlas University, 34408 Istanbul, Türkiye.
ORCID-Profile: Beyza Öztürk, Ayşenur İgit, Aylin Kaya, Zeynep Tuğsem Çamlıca, Selen Arıcı, Muhammed Faruk Şahin
Zitieren
APA
Öztürk, B., İgit, A., Kaya, A., Çamlıca, Z. T., Arıcı, S., & Şahin, M. F. (2026). 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. https://doi.org/10.3390/ijms27073134
Vancouver
Öztürk B, İgit A, Kaya A, Çamlıca ZT, Arıcı S, Şahin MF. 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. 2026. doi:10.3390/ijms27073134
BibTeX
@article{ztrk2026,
author = {Öztürk, Beyza and İgit, Ayşenur and Kaya, Aylin and Çamlıca, Zeynep Tuğsem and Arıcı, Selen and Şahin, Muhammed Faruk},
title = {TC-HUR: A Tri-Phase Cauchy-Assisted Hunger Games Search and Unified Runge–Kutta Optimizer for Robust DNA Data Storage},
journal = {International Journal of Molecular Sciences},
year = {2026},
doi = {10.3390/ijms27073134}
}
EUVIMED