Application of a novel IWO to the design of encoding sequences for DNA computing

Encoding and processing information in DNA-, RNA- and other biomolecule-based devices is an important requirement for DNA based computing with potentially important applications. To make DNA computing more reliable, much work has focused on designing the good DNA sequences. However, this is a bothersome task as encoding problem is an NP problem. In this paper, a new methodology based on the IWO algorithm is developed to optimize encoding sequences. Firstly, the mathematics models of constrained objective optimization design for encoding problems based on the thermodynamic criteria are set up. Then, a modified IWO method is developed by defining the colonizing behavior of weeds to overcome the obstacles of the original IWO algorithm, which cannot be applied to discrete problems directly. The experimental results show that the proposed method is effective and convenient for the user to design and select effective DNA sequences in silicon for controllable DNA computing.

[1]  R. Deaton,et al.  A DNA based implementation of an evolutionary search for good encodings for DNA computation , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[3]  Masahito Yamamoto,et al.  Towards a general-purpose sequence design system in DNA computing , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  Max H. Garzon,et al.  Good encodings for DNA-based solutions to combinatorial problems , 1996, DNA Based Computers.

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

[6]  Z. Shabarova,et al.  Modification of end phosphate gruops in mono- and oligonucleotides. , 1976, Nucleic acids research.

[7]  Darko Stefanovic,et al.  Designing Nucleotide Sequences for Computation: A Survey of Constraints , 2005, DNA.

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

[9]  Caro Lucas,et al.  A novel numerical optimization algorithm inspired from weed colonization , 2006, Ecol. Informatics.

[10]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[11]  A. Condon,et al.  Demonstration of a word design strategy for DNA computing on surfaces. , 1997, Nucleic acids research.

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

[13]  Fumiaki Tanaka,et al.  Design of nucleic acid sequences for DNA computing based on a thermodynamic approach , 2005, Nucleic acids research.

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

[15]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[16]  Masahito Yamamoto,et al.  Thermodynamic parameters based on a nearest-neighbor model for DNA sequences with a single-bulge loop. , 2004, Biochemistry.

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

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