Constructing DNA Codes with Larger Distance from Quaternary Words

In this work, we propose a novel method to construct DNA codes from quaternary words. The method uses permutation groups that act in the set {1, 2, …, 4n}, representing the coordinate and coordinate value of quaternary words. The DNA code is obtained by finding a clique of the construction graph and mapping it using the bijective map 0 → A, 1 → C, 2 → T, 3 → G. We present a new approach to construct DNA codes with larger Hamming distance and reverse-complement distance compared to previously obtained DNA codes. This is achieved by using a modified construction graph tailored to the desired distance parameter. As a result, we can refine a DNA code to have improved Hamming distance and reverse-complement distance while maintaining the fixed GC-content constraint. This method simplifies the search for DNA codes with large distance parameters.

Authors

Publication Details

Journal
Jambura Journal of Mathematics
Published
2025-08-15
DOI
https://doi.org/10.37905/jjom.v7i2.33132
Primary Topic
DNA and Biological Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Constructing DNA Codes with Larger Distance from Quaternary Words

Benediktus Panji Pradipta, Nikken Prima Puspita
Jambura Journal of Mathematics
DNA and Biological Computing
article

Constructing DNA Codes with Larger Distance from Quaternary Words

Benediktus Panji Pradipta, Nikken Prima Puspita
article en

Abstract

In this work, we propose a novel method to construct DNA codes from quaternary words. The method uses permutation groups that act in the set {1, 2, …, 4n}, representing the coordinate and coordinate value of quaternary words. The DNA code is obtained by finding a clique of the construction graph and mapping it using the bijective map 0 → A, 1 → C, 2 → T, 3 → G. We present a new approach to construct DNA codes with larger Hamming distance and reverse-complement distance compared to previously obtained DNA codes. This is achieved by using a modified construction graph tailored to the desired distance parameter. As a result, we can refine a DNA code to have improved Hamming distance and reverse-complement distance while maintaining the fixed GC-content constraint. This method simplifies the search for DNA codes with large distance parameters.

Jambura Journal of MathematicsVol. 7(2)
Openalex Percentile: Top 80%
DNA and Biological Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Constructing DNA Codes with Larger Distance from Quaternary Words — Benediktus Panji Pradipta, Nikken Prima Puspita · Jambura Journal of Mathematics (2025) | TGRS Research Map | TGRS