DNA computing began in 1994 when Leonard Adleman has first shown that computing can be done using DNA also, without using usual machine but using test tubes etc. in a biological laboratory. For this, he has chosen Hamiltonian path problem (HPP) known to us as the Traveling salesman problem (TSP) and obtained solution using DNA experiments. Things would not have gone further if the problem he has chosen is simple but as he has taken HPP, which is an NP-Complete problem for which there is no polynomial time algorithm using conventional computer, it created an exciting and made people to think more about DNA computing. The power of the method proposed by Adleman is in the fact that tremendous parallelism can be introduced using DNA operations and that helped Adleman to solve an NP-Complete problem. Also during the same time Charles Bennett’s has done some work on DNA computing.[2]
Adleman, now considered the father of DNA computing, is a professor at the University of Southern California and spawned the field with his paper, ”Molecular Computation of Solutions of Combinatorial Problems.” Since then, Adleman has demonstrated how the massive parallelism of a trillion DNA strands can simultaneously attack different aspects of a computation to crack even the toughest combinatorial problems, such as the government’s supposedly uncrackable Data Encryption Standard.
Click here to Download the formatted Seminar report
No comments:
Post a Comment