Implementation of an ant colony system for DNA sequence optimization

被引：9

作者：

Ibrahim, Zuwairie ^{[1
]}

Kurniawan, Tri ^{[1
]}

Khalid, Noor ^{[1
]}

Sudin, Shahdan ^{[1
]}

Khalid, Marzuki ^{[1
]}

机构：

[1] Univ Teknol Malaysia, Fac Elect Engn, Ctr Artificial Intelligence & Robot CAIRO, Skudai 81310, Johor Darul Tak, Malaysia

来源：

ARTIFICIAL LIFE AND ROBOTICS | 2009年 / 14卷 / 02期

关键词：

Ant colony system; DNA computing; DNA sequence design;

D O I：

10.1007/s10015-009-0683-0

中图分类号：

TP24 [机器人技术];

学科分类号：

080202 ; 1405 ;

摘要：

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.

引用

页码：293 / 296

页数：4

共 15 条

[1] Strand design for biomolecular computation [J].

Brenneman, A ;

Condon, A .

THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) :39-58

[2]

Deaton RJ, 1996, DNA BASED COMPUTERS, P247

[3]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[4]

Dorigo M., 2004, ANT COLONY OPTIMIZAT

[5]

Dorigo M., 1992, PH THESIS

[6]

Feldkamp U., 2001, 7th International Meeting on DNA Based Computers, P179

[7]

FRUTOS AG, 1997, P 3 DIMACS WORKSH DN

[8]

JIN Y, 2001, P GECCO 2001 C

[9]

KASHIWAMURA S, 2003, P 2003 INT TECHN C C, P1815

[10]

Kurniawan T. B., 2008, P 4 IASTED INT C ADV, P144

← 1 2 →