Muhammad, M. S. and Selvan, K. V. and Masra, S. M. W. and Ibrahim, Zuwairie and Zainal Abidin, Amar Faiz (2011) An improved binary particle swarm optimization algorithm for DNA encoding enhancement. In: IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SIS 2011: 2011 IEEE Symposium on Swarm Intelligence. IEEE Explorer, pp. 60-67. ISBN 978-161284052-9
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/SIS.2011.5952579
The accuracy of DNA computing highly depends on the DNA strands used in solving complex computations. As such, many approaches are proposed to design DNA oligonucleotides that are stable and unique. In this paper, an improved binary particle swarm optimization (IBPSO) algorithm is proposed and implemented. Four objective functions which are H-measure, similarity, hairpin and continuity are employed to define the uniqueness of designed sequences. The DNA words are constrained within a predefined range of GC-content and melting temperature. The performances and the ability of the algorithm to enhance the characteristics of generated DNA code words are analyzed. The results obtained show that this algorithm executes better sequences and did perform better compared to other optimization techniques. Moreover, it converges faster than the previously suggested binary particle swarm optimization algorithm.
|Item Type:||Book Section|
|Uncontrolled Keywords:||DNA computing, DNA oligonucleotides, improved binary particle swarm optimization (IBPSO)|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Deposited By:||Liza Porijo|
|Deposited On:||16 Nov 2012 06:58|
|Last Modified:||04 Feb 2017 08:36|
Repository Staff Only: item control page