Abstract
DNA computation exploits the computational power inherent in molecules for information processing. However, in order to perform the computation correctly, a set of good DNA sequences is crucial. A lot of work has been carried out on designing good DNA sequences to archive a reliable molecular computation. In this article, the ant colony system (ACS) is introduced as a new tool for DNA sequence design. In this approach, the DNA sequence design is modeled as a path-finding problem, which consists of four nodes, to enable the implementation of the ACS. The results of the proposed approach are compared with other methods such as the genetic algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Maley CC (1998) DNA computing: theory, practice, and prospects. Evol Comput 6:201–229
Brenneman A, Condon A (2002) Strand design for biomolecular computation. Theor Comput Sci 287:39–58
Kashiwamura S, Kameda A, Yamamoto M, et al (2003) Two-step search for DNA sequence design. Proceedings of the 2003(ITCCSCC 03), pp 1815–1818
Shin SY, Lee IH, Kim D, et al (2005) Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Trans Evolut Comput 9:143–158
Frutos AG, Thiel AJ, Condon AE, et al (1997) DNA computing at surfaces: four base mismatch word design. Proceedings of the 3rd DIMACS Workshop on DNA Based Computers
Feldkamp U, Saghafi S, Banzhaf W, et al (2001) DNA sequence generator: a program for the construction of DNA sequences. Proceedings of the 7th International Workshop on DNA Based Computers, pp 179–188
Tanaka F, Nakatsugawa M, Yamamoto M, et al (2001) Developing support system for sequence design in DNA computing. Proceedings of the 7th International Workshop on DNA Based Computers, pp 340–349
Tanaka F, Kameda A, Yamamoto M, et al (2004) Thermodynamic parameter based on nearest-neighbor model for DNA sequences with a single-bulge loop. Biochemistry 43(22):7143–7150
Kurniawan TB, Khalid NK, Ibrahim Z, et al (2008) An ant colony system for DNA sequence design based on thermodynamics. Proceedings of IASTED-ACST, ACTA, Calgary, Canada, pp 144–149
Dorigo M (1992) Optimization, learning and natural algorithms. PhD Thesis, Dipartimento di Elettronica, Politechico di Milano, Italy
Dorigo M, Luca MG (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1:53–56
Taillard ED, Gambardella LM (1999) adaptive memories for the quadratic assignment problems. Technical report IDSIA-87-97, IDSIA, Lugano
Dorigo M, Stutzle T (2004) Ant colony optimization. Massachusetts Institute of Technology
Jin Y, Olhofer M, Sendhoff B (2001) Dynamic weighted aggregation for evolutionary multi-objective optimization: how does it work and how? Proceedings of the GECCO 2001 Conference
Deaton R, Murphy RC, Garzon M, et al (1996) Good encodings for DNA-based solutions to combinatorial problems. Proceedings of the 2nd Annual Meeting on DNA Based Computing, pp 247–258
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 14th International Symposium on Artificial Life and Robotics, Oita, Japan, February 5–7, 2009
About this article
Cite this article
Ibrahim, Z., Kurniawan, T.B., Khalid, N.K. et al. Implementation of an ant colony system for DNA sequence optimization. Artif Life Robotics 14, 293–296 (2009). https://doi.org/10.1007/s10015-009-0683-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-009-0683-0