DNA Base-Code Generation for Bio-molecular Computing by Using a Multiobjective Approach Based on SPEA2

  • José M. Chaves-González
  • Miguel A. Vega-Rodríguez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8111)


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.


DNA Sequence Design Multiobjective Optimization SPEA2 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Brenneman, A., Condon, A.: Strand design for biomolecular computation. Theoretical Computation Science 287, 39–58 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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. 4.
    Zitzler, E., et al.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: Proceedings of EUROGEN 2002, pp. 95–100 (2002)Google Scholar
  5. 5.
    Garzon, M.H., Deaton, R.J.: Biomolecular computing and programming. IEEE Trans. Evol. Computation 3, 236–250 (1999)CrossRefGoogle Scholar
  6. 6.
    Shin, S.-Y., et al.: Multiobjective Evolutionary Optimization of DNA Sequences for Reliable DNA Computing. IEEE Trans. Evolutionary Computation 9(2), 143–158 (2005)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 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. 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
  10. 10.
    Faulhammer, D., et al.: Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences 97, 1385–1389 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • José M. Chaves-González
    • 1
  • Miguel A. Vega-Rodríguez
    • 1
  1. 1.Dept. Computers and Communications Technologies, Escuela PolitécnicaUniv. ExtremaduraCáceresSpain

Personalised recommendations