A population-based ant colony optimization approach for DNA sequence optimization
DNA computing is a new computing paradigm which uses bio-molecular as information storage media and biochemical tools as information processing operators. It has shows many successful and promising results for various applications. Since DNA reactions are probabilistic reactions, it can cause the di...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Book Section |
| Published: |
IEEE
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/11870/ http://dx.doi.org/10.1109/AMS.2009.79 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | DNA computing is a new computing paradigm which uses bio-molecular as information storage media and biochemical tools as information processing operators. It has shows many successful and promising results for various applications. Since DNA reactions are probabilistic reactions, it can cause the different results for the same situations, which can be regarded as errors in the computation. To overcome the drawbacks, much works have focused to design the error-minimized DNA sequences to improve the reliability of DNA computing. In this research, Population-based Ant Colony Optimization (P-ACO) is proposed to solve the DNA sequence optimization. PACO approach is a meta-heuristic algorithm that uses some ants to obtain the solutions based on the pheromone in their colony. The DNA sequence design problem is modelled by four nodes, representing four DNA bases (A, T, C, and G). The results from the proposed algorithm are compared with other sequence design methods, which are Genetic Algorithm (GA), and Multi-Objective Evolutionary Algorithm (MOEA) methods. The DNA sequences optimized by the proposed approach have better result in some objective functions than the other methods. |
|---|