Agent-oriented approach to DNA computing

Author

Steele, Grace ; Stojkovic, Vojislav

Author_Institution

MSU, Baltimore, MD, USA

fYear

2004

fDate

16-19 Aug. 2004

Firstpage

546

Lastpage

551

Abstract

DNA computing began in 1994 when Leonard Adleman showed that DNA computing was possible by solving the Traveling Salesman Problem on a DNA (molecule or chemical) computer. Since then, Adleman has demonstrated many times how to use the massive parallelism of billions of DNA strands to solve the toughest problems. Adleman´s work has greatly influenced our work, however, our approach is different. Adleman´s approach was chemical-oriented, while our approach is software agent-oriented based on modeling, simulation, visualization, and animation using the programming language Easel. We have tried to elevate Adleman´s work by making it more applicable and all encompassing. The work presents an agent-oriented approach to DNA computing using the Easel programming language. The Traveling Salesman Problem is used to demonstrate the idea and test the program.

Keywords

biocomputers; biocomputing; object-oriented programming; programming languages; software agents; DNA computer; DNA computing; Easel programming language; Traveling Salesman Problem; animation; modeling; simulation; software agent-oriented approach; visualization; Animation; Biochemistry; Biology computing; Chemical processes; Computational modeling; Computer aided manufacturing; Computer languages; DNA computing; Traveling salesman problems; Visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Systems Bioinformatics Conference, 2004. CSB 2004. Proceedings. 2004 IEEE

Print_ISBN

0-7695-2194-0

Type

conf

DOI

10.1109/CSB.2004.1332491

Filename

1332491