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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
