Performance Evaluation and Benchmarking of an Extended Computational Model of Ant Colony System for DNA Sequence Design

Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. In literature, ACS has been employed to solve DNA sequence design problem. The DNA sequence design problem was modelled based on a finite state machine in which the nodes represent the DNA bases {A, C, T, G}. Later in 2011, an extended computational model of finite state machine has been employed for DNA sequence design using ACS. The performance evaluation, however, was limited. In this study, the extended computational model of finite state machine is revisited and an extensive performance evaluation is conducted using 5, 7, 10, 15, 20, 25, 30, 35, and 40 agents/ants, each with 100 independent runs. The performance of the extended computational model is also benchmarked with the existing algorithm such as a Genetic Algorithm (GA), Multi-Objective Evolutionary Algorithm (MOEA), and Particle Swarm Optimisation (PSO). Keywords-Ant Colony System, DNA Sequence Design, Finite State Machine.

[1]  Masahito Yamamoto,et al.  Developing Support System for Sequence Design in DNA Computing , 2001, DNA.

[2]  David Harlan Wood,et al.  A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides , 2002, DNA.

[3]  Pan Linqiang,et al.  A new approach based on PSO algorithm to find good computational encoding sequences , 2007 .

[4]  Marzuki Khalid,et al.  Implementation of an ant colony system for DNA sequence optimization , 2009, Artificial Life and Robotics.

[5]  Marzuki Khalid,et al.  Evaluation of Ordering Methods for DNA Sequence Design Based on Ant Colony System , 2008, 2008 Second Asia International Conference on Modelling & Simulation (AMS).

[6]  Byoung-Tak Zhang,et al.  Molecular Algorithms for Efficient and Reliable DNA Computing , 1998 .

[7]  Jing Zhao,et al.  DNA Encodings Based on Multi-Objective Particle Swarm , 2007 .

[8]  D. Gifford,et al.  Automated constraint-based nucleotide sequence selection for DNA computation. , 1999, Bio Systems.

[9]  Wolfgang Banzhaf,et al.  DNASequencesGenerator: A Program for the Construction of DNA Sequences , 2001, DNA.

[10]  Byoung-Tak Zhang,et al.  Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing , 2005, IEEE Transactions on Evolutionary Computation.

[11]  Andries Petrus Engelbrecht,et al.  Implementation of Binary Particle Swarm Optimization for DNA Sequence Design , 2009, IWANN.

[12]  Lila Kari,et al.  Coding Properties of DNA Languages , 2001, DNA.

[13]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[14]  M AdlemanLeonard.  Molecular computation of solutions to combinatorial problems , 1994 .

[15]  Seri Mastura Mustaza,et al.  A modified computational model of ant colony system in DNA sequence design , 2011, 2011 IEEE Student Conference on Research and Development.

[16]  Satoshi Kobayashi,et al.  DNA sequence design using templates , 2002, New Generation Computing.

[17]  신수용,et al.  Multi-Objective Evolutionary Optimization of DNA Sequences for Molecular Computing , 2005 .

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Sung-yong Shin,et al.  Multi-Objective Evolutionary Optimization of DNA Sequences for Molecular Computing , 2005 .

[20]  Amit Marathe,et al.  On combinatorial DNA word design , 1999, DNA Based Computers.

[21]  Marzuki Khalid,et al.  A Population-Based Ant Colony Optimization Approach for DNA Sequence Optimization , 2009, 2009 Third Asia International Conference on Modelling & Simulation.

[22]  Max H. Garzon,et al.  Codeword design and information encoding in DNA ensembles , 2004, Natural Computing.

[23]  Junzo Watada,et al.  An ant colony system for solving DNA sequence design problem in DNA computing , 2012 .

[24]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.