Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Brenneman, A., Condon, A.: Strand design for biomolecular computation. Theoretical Computation Science 287, 39–58 (2002)
Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evol. Computation. Kluwer (2002)
Zitzler, E., et al.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: Proceedings of EUROGEN 2002, pp. 95–100 (2002)
Garzon, M.H., Deaton, R.J.: Biomolecular computing and programming. IEEE Trans. Evol. Computation 3, 236–250 (1999)
Shin, S.-Y., et al.: Multiobjective Evolutionary Optimization of DNA Sequences for Reliable DNA Computing. IEEE Trans. Evolutionary Computation 9(2), 143–158 (2005)
Santa Lucia Jr., J.: A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Nat. Acad. Sci. U.S.A. 95, 1460–1465 (1998)
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)
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)
Faulhammer, D., et al.: Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences 97, 1385–1389 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaves-González, J.M., Vega-Rodríguez, M.A. (2013). DNA Base-Code Generation for Bio-molecular Computing by Using a Multiobjective Approach Based on SPEA2. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53856-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-53856-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53855-1
Online ISBN: 978-3-642-53856-8
eBook Packages: Computer ScienceComputer Science (R0)