Journal Article10.11113/JT.V54.819
Function Minimization In DNA Sequence Design Based On Binary Particle Swarm Optimization
Zuwairie Ibrahim,Noor Khafifah Khalid,Ismail Sheng,Salinda Buyamin,Zulkifli Md. Yusof,Mohd Saufee Muhammad +5 more
- 01 Jan 2011
- Vol. 54, Iss: 1, pp 331-342
TL;DR: In this paper, a binary particle swarm optimization (BinPSO) is proposed to minimize the objective functions individually, subjected to two constraints: melting temperature and GCcontent. And the results obtained show the correctness of PSO computation, where the minimized values for each objective can be achieved.
read more
Abstract: In DNA based computation and DNA nanotechnology, the design of good DNA sequences has turned out to be an elementary problem and one of the most practical and important research topics. Although the design of DNA sequences is dependent on the protocol of biological experiments, it is highly required to establish a method for the systematic design of DNA sequences, which could be applied to various design constraints. Basically, the fitness of DNA sequences can be evaluated using four objective functions, namely, similarity, Hmeasure, continuity and hairpin. In this paper, binary particle swarm optimization (BinPSO) is proposed to minimize those objective functions individually, subjected to two constraints: melting temperature and GCcontent. An implementation of the optimization process is presented using 20 particles and the results obtained shows the correctness of PSO computation, where the minimized values for each objective can be achieved.
Kata kunci: DNA sequence design; binary particle swarm optimization; objective function; constraints; fitness function
Dalam DNA berasaskan pengiraan dan nanoteknologi DNA, reka bentuk jujukan–jujukan DNA baik telah menjadi satu masalah asas dan salah satu topik–topik penyelidikan penting dan paling praktikal. Walaupun reka bentuk DNA berjujukan adalah bergantung kepada pada protokol eksperimen biologi, ia amat diperlukan bagi mewujudkan satu kaedah untuk reka bentuk bersistem DNA berjujukan, yang boleh digunakan untuk pelbagai reka bentuk kekangan. Pada asasnya, kecergasan DNA berjujukan boleh dinilaikan menggunakan empat fungsi–fungsi objektif, iaitu, similarity, Hmeasure, continuity dan hairpin. Dalam kertas kerja ini, pengoptimuman kerumunan zarah perduaan (BinPSO) dicadangkan untuk meminimumkan fungsi–fungsi objektif tersebut secara individu, tertakluk kepada dua kekangan: melting temperature dan GCcontent Satu perlaksanaan proses pengoptimuman dibentangkan menggunakan 20 zarah–zarah dan keputusan yang diperolehi menunjukkan kebenaran pengiraan PSO, di mana nilai–nilai yang minimum untuk setiap objektif dapat dicapai.
Key words: Reka bentuk jujukan DNA; pengoptimuman kerumunan zarah perduaan; fungsi objektif; kekangan; fungsi kecergasan
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Explainable step-wise binary classification for the susceptibility assessment of geo-hydrological hazards
Ömer Ekmekcioğlu,Kerim Koc +1 more
TL;DR: In this article , the authors proposed a novel step-wise binary prediction framework for the susceptibility assessment of geo-hydrological hazards specific to floods and landslides in the Kentucky River basin, United States.
39
•Journal Article
Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems
Zulkifli Md. Yusof,Zuwairie Ibrahim,Ismail Ibrahim,Kamil Zakwan Mohd Azmi,Nor Azlina Ab Aziz,Nor Hidayati Abd Aziz,Mohd Saberi Mohamad +6 more
TL;DR: The proposed angle modulated SKF (AMSKF) is compared against two other discrete population-based optimization algorithms, namely, binary particle swarm optimization (BPSO) and binary gravitational search algorithm (BGSA), and it is found that the proposed AMSKF is as competitive as BGSA but the BPSO is superior to the both AMSKFs.
•Journal Article
Distance evaluated simulated kalman filter for combinatorial optimization problems
Md. Yusof Zulkifli,Ibrahim Zuwairie,Ibrahim Ismail,Mohd Azmi Kamil Zakwan,Ab. Aziz Nor Azlina,Abd Aziz Nor Hidayati,Mohamad Mohd Saberi +6 more
TL;DR: Based on the analysis of experimental results, it is found that the proposed AMSKF is as competitive as BGSA but the BPSO is superior than the both DESKF and BGSA.
33
Local Optimum Distance Evaluated Simulated Kalman Filter For Combinatorial Optimization Problems
Md. Yusof Zulkifli,Ibrahim Ismail,Ibrahim Zuwairie,Abas Khairul Hamimah,Ab. Aziz Nor Azlina,Abd Aziz Nor Hidayati,Mohamad Mohd Saberi +6 more
- 01 Jan 2016
TL;DR: An extended version of SKF algorithm, which is termed as Local Optimum Distance Evaluated Simulated Kalman Filter (LODESKF), is proposed, where a mapping function is used to enable the SKF algorithms to operate in binary search space.
16
Global Optimum Distance Evaluated Particle Swarm Optimization for Combinatorial Optimization Problem
Mustapa Ainizar,Ibrahim Zuwairie,Md. Yusof Zulkifli,Ibrahim Ismail +3 more
- 01 Jan 2016
TL;DR: A new global optimum distance evaluated approach is proposed and combined with PSO and it is found that the proposed DEPSO is capable to solve discrete optimization problems using TSP.
1
References
Particle Swarm Optimization.
James Kennedy
- 01 Jan 2017
TL;DR: A concept for the optimization of nonlinear functions using particle swarm methodology is introduced, and the evolution of several paradigms is outlined, and an implementation of one of the paradigm is discussed.
35K
Particle swarm optimization
TL;DR: A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
A discrete binary version of the particle swarm algorithm
James Kennedy,Russell C. Eberhart +1 more
- 12 Oct 1997
TL;DR: The paper reports a reworking of the particle swarm algorithm to operate on discrete binary variables, where trajectories are changes in the probability that a coordinate will take on a zero or one value.
5K
Molecular computation of solutions to combinatorial problems
TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.
Comparing inertia weights and constriction factors in particle swarm optimization
Russell C. Eberhart,Yuhui Shi +1 more
- 16 Jul 2000
TL;DR: It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension.
3.3K