.png){kind=icon}
.png){kind=icon}
Return
Dna coding theory and algorithms
.png){kind=icon}
OA
AI
DOI：10.1007/s10462-025-11132-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
DNA computing is an emerging computational model that has garnered significant attention due to its distinctive advantages at the molecular biological level. Since it was introduced by Adelman in 1994, this field has made remarkable progress in solving NP-complete problems, enhancing information security, encrypting images, controlling diseases, and advancing nanotechnology. A key challenge in DNA computing is the design of DNA coding, which aims to minimize nonspecific hybridization and enhance computational reliability. The DNA coding design is a classical combinatorial optimization problem focused on generating high-quality DNA sequences that meet specific constraints, including distance, thermodynamics, secondary structure, and sequence requirements. This paper comprehensively examines the advances in DNA coding design, highlighting mathematical models, counting theory, and commonly used DNA coding methods. These methods include the template method, multi-objective evolutionary methods, and implicit enumeration techniques.
Keywords:
DNA computing
DNA coding design
Combinatorial optimization problems
Multi-objective optimization algorithms
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W