Implementation of ant colony system for DNA sequence optimization

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

DNA computation as a new paradigm has the computational power of molecules for information processing and many computational models have been proposed for solving mathematical problems in laboratory experiments. In order to achieve the correct computation, a set good of DNA sequences is crucial, because the code determines the way to process information on sequences in the experiments. Much works have focused on designing the DNA sequences to archive a reliable molecular computation and many algorithms have been proposed to obtain a set of good DNA sequences. In this paper, Ant Colony System (ACS) is proposed to solve the DNA sequence design problem. ACS used some ants to get their solutions based on the pheromone in their colony. A model is prepared which consists of four nodes representing four DNA bases. The results of the proposed approach are compared with the other methods such as Genetic Algorithm. ©ISAROB 2009.

Cite

CITATION STYLE

APA

Ibrahim, Z., Kurniawan, T. B., Khalid, N. K., & Khalid, M. (2009). Implementation of ant colony system for DNA sequence optimization. In Proceedings of the 14th International Symposium on Artificial Life and Robotics, AROB 14th’09 (pp. 712–715).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free