No default citation style available for Eprints
|
Pdf
DNA sequence design for direct-proportional length-based DNA computing.pdf Download (277kB) | Preview |
Abstract
Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. Previously, direct-proportional length-based DNA computing which involved DNA sequences with different lengths has been implemented to solve the shortest path problem. In this study, particle swarm optimization (PSO) and population-based ant colony optimization (P-ACO) are employed to design DNA sequences with different lengths and the results obtained are compared. Further comparison with the sequences generated by graph and generate-and-test methods is presented. The results show that P-ACO approach can generate relatively better DNA sequences in some objectives than PSO approach and the other methods. It can be concluded that the P-ACO algorithm can obtain relatively a better set of DNA sequences for DNA computing with length constraints.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Additional Information: | Indexed by Scopus |
| Uncontrolled Keywords: | DNA; sequence design; P-ACO; PSO |
| Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |
| Faculty/Division: | Faculty of Electrical & Electronic Engineering |
| Depositing User: | Mrs. Neng Sury Sulaiman |
| Date Deposited: | 22 Mar 2020 23:43 |
| Last Modified: | 22 Mar 2020 23:43 |
| URI: | http://umpir.ump.edu.my/id/eprint/26995 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |