Agent-Oriented Approach to DNA Computing

Authors:
Grace Steele;Vojislav Stojkovic
Affiliations:
Morgan State University;Morgan State University
Venue:
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Year:
2004

Citing 2
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Using Easel for Modeling and Simulating the Interactions of Cells in Order to Better Understand the Basics of Biological Processes and to Predict Their Likely Behaviors

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA computing began in 1994 when Leonard Adleman [1], [2] 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 paper 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.