ABSTRACT
This chapter focuses on research trends in DNA computing. It examines various types of DNA computing algorithms. DNA undergoes a process of replication and synthesizes new strands of DNA. The concept of DNA computing was published by Dr. Leonard Adleman in November 1994 in an article in the prestigious journal Science. DNA computing is based on the idea of molecular biology processes that can be used to perform arithmetic/logic operations on information encoded as strands of DNA. Through nondeterministic algorithms, a large number of problems can be conceptualized in DNA computing theory. The chapter provides some algorithms of DNA computing like quantum-behaved particle swarm optimization (QPSO), Vector Evaluated Particle Swarm Optimization (VEPSO), and vector-evaluated QPSO. QPSO is based on an adaptive DNA computing algorithm. VEPSO is a new approach to improving DNA computing that is currently being proposed and advocated. The VEQPSO algorithm is conceptually simple.
