Related Experiment Video
Updated: Mar 23, 2026

Designing a Bio-responsive Robot from DNA Origami
Published on: July 8, 2013
IWO Algorithm Based on Niche Crowding for DNA Sequence Design
Gaijing Yang1, Bin Wang1, Xuedong Zheng1
1Key Laboratory of Advanced Design and Intelligent Computing (Dalian University), Ministry of Education, Dalian, 116622, China.
Abstract:
The design of DNA sequences is essential for the implementation of DNA computing, where the quantity and quality can directly affect the accuracy and efficiency of calculations. Many studies have focused on the design of good DNA sequences to make DNA computing more reliable. However, DNA sequence design needs to satisfy various constraints at the same time, which is an NP-hard problem. In this study, we specify appropriate constraints that should be satisfied in the design of DNA sequences and we propose evaluation formulae. We employ the Invasive Weed Optimization (IWO) algorithm and the niche crowding in the algorithm to solve the DNA sequence design problem. We also improve the spatial dispersal in the traditional IWO algorithm. Finally, we compared the sequences obtained with existing sequences based on the results obtained using a comprehensive fitness function, which demonstrated the efficiency of the proposed method.
Related Concept Videos
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while...
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Sanger Sequencing

