DNA Base-Code Generation for Bio-molecular Computing by Using a Multiobjective Approach Based on SPEA2
The design of DNA strands suitable for bio-molecular computing involves several complex constraints which have to be fulfilled to ensure the reliability of operations. Two of the most important properties which have to be controlled to obtain reliable sequences are self-assembly and self-complementary hybridizations. These processes have to be restricted to avoid undesirable interactions which could produce incorrect computations. Our study is focused on six different design criteria that provide reliable and robust DNA sequences. We have tackled the problem as a multiobjective optimization problem in which there is not only an optimal solution, but a Pareto set of solutions. In this paper, we have used the Strength Pareto Evolutionary Algorithm 2 (SPEA2) to generate reliable DNA sequences for three different real datasets used in bio-molecular computation. Results indicate that our approach obtains satisfactory DNA libraries that are more reliable than other results previously published in the literature.
KeywordsDNA Sequence Design Multiobjective Optimization SPEA2
Unable to display preview. Download preview PDF.
- 3.Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evol. Computation. Kluwer (2002)Google Scholar
- 4.Zitzler, E., et al.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: Proceedings of EUROGEN 2002, pp. 95–100 (2002)Google Scholar
- 8.Deaton, R., et al.: Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of 2nd Annual Meeting on DNA Based Computers, pp. 247–258 (1996)Google Scholar
- 9.Tanaka, F., et al.: Toward a general-purpose sequence design system in DNA computing. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp. 73–78 (2002)Google Scholar