loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 IEEE Computational Systems Bioinformatics Conference (CSB'04)
Agent-Oriented Approach to DNA Computing
Stanford, California
August 16-August 19
ISBN: 0-7695-2194-0
Grace Steele, Morgan State University
Vojislav Stojkovic, Morgan State University

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.

Citation:
Grace Steele, Vojislav Stojkovic, "Agent-Oriented Approach to DNA Computing," csb, pp.546-551, 2004 IEEE Computational Systems Bioinformatics Conference (CSB'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.