Implementation of binary particle swarm optimization for DNA sequence design

In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an essential problem and one of the most practical and important research topics. Basically, the DNA sequence design problem is a multi-objective problem, and it can be evaluated using four objecti...

Full description

Saved in:
Bibliographic Details
Main Authors: Khalid, Noor Khafifah, Ibrahim, Zuwairie, Kurniawan, Tri Basuki, Khalid, Marzuki, Engelbrecht, Andries P.
Format: Book Section
Published: Springer Berlin Heidelberg 2009
Subjects:
Online Access:http://eprints.utm.my/id/eprint/15103/
http://dx.doi.org/10.1007/978-3-642-02481-8_64
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.15103
record_format eprints
spelling my.utm.151032011-09-30T15:09:46Z http://eprints.utm.my/id/eprint/15103/ Implementation of binary particle swarm optimization for DNA sequence design Khalid, Noor Khafifah Ibrahim, Zuwairie Kurniawan, Tri Basuki Khalid, Marzuki Engelbrecht, Andries P. TK Electrical engineering. Electronics Nuclear engineering In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an essential problem and one of the most practical and important research topics. Basically, the DNA sequence design problem is a multi-objective problem, and it can be evaluated using four objective functions, namely, H measure , similarity, continuity, andhairpin. There are several ways to solve a multi-objective problem, such as value function method, weighted sum method, and using evolutionary algorithms. However, in this paper, common method has been used, namely weighted sum method to convert DNA sequence design problem into single objective problem. Binary particle swarm optimization (BinPSO) is proposed to minimize the objective in the problem, subjected to two constraints: melting temperature and GC content. Based on experiments and researches done, 20 particles are used in the implementation of the optimization process, where the average values and the standard deviation for 100 runs are shown along with comparison to other existing methods. The results obtained verified that BinPSO can suitably solve DNA sequence design problem using the proposed method and model, comparatively better than other approaches. Springer Berlin Heidelberg 2009 Book Section PeerReviewed Khalid, Noor Khafifah and Ibrahim, Zuwairie and Kurniawan, Tri Basuki and Khalid, Marzuki and Engelbrecht, Andries P. (2009) Implementation of binary particle swarm optimization for DNA sequence design. In: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. Springer Berlin Heidelberg, pp. 450-457. ISBN 3642024807; 978-364202480-1 http://dx.doi.org/10.1007/978-3-642-02481-8_64 doi:10.1007/978-3-642-02481-8_64
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
Khalid, Noor Khafifah
Ibrahim, Zuwairie
Kurniawan, Tri Basuki
Khalid, Marzuki
Engelbrecht, Andries P.
Implementation of binary particle swarm optimization for DNA sequence design
description In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an essential problem and one of the most practical and important research topics. Basically, the DNA sequence design problem is a multi-objective problem, and it can be evaluated using four objective functions, namely, H measure , similarity, continuity, andhairpin. There are several ways to solve a multi-objective problem, such as value function method, weighted sum method, and using evolutionary algorithms. However, in this paper, common method has been used, namely weighted sum method to convert DNA sequence design problem into single objective problem. Binary particle swarm optimization (BinPSO) is proposed to minimize the objective in the problem, subjected to two constraints: melting temperature and GC content. Based on experiments and researches done, 20 particles are used in the implementation of the optimization process, where the average values and the standard deviation for 100 runs are shown along with comparison to other existing methods. The results obtained verified that BinPSO can suitably solve DNA sequence design problem using the proposed method and model, comparatively better than other approaches.
format Book Section
author Khalid, Noor Khafifah
Ibrahim, Zuwairie
Kurniawan, Tri Basuki
Khalid, Marzuki
Engelbrecht, Andries P.
author_facet Khalid, Noor Khafifah
Ibrahim, Zuwairie
Kurniawan, Tri Basuki
Khalid, Marzuki
Engelbrecht, Andries P.
author_sort Khalid, Noor Khafifah
title Implementation of binary particle swarm optimization for DNA sequence design
title_short Implementation of binary particle swarm optimization for DNA sequence design
title_full Implementation of binary particle swarm optimization for DNA sequence design
title_fullStr Implementation of binary particle swarm optimization for DNA sequence design
title_full_unstemmed Implementation of binary particle swarm optimization for DNA sequence design
title_sort implementation of binary particle swarm optimization for dna sequence design
publisher Springer Berlin Heidelberg
publishDate 2009
url http://eprints.utm.my/id/eprint/15103/
http://dx.doi.org/10.1007/978-3-642-02481-8_64
_version_ 1643646480203907072
score 13.211869