jueves, junio 14, 2007
Leonard Adleman (born December 31, 1945) is a theoretical computer scientist and professor ofcomputer science and molecular biology at the University of Southern California. He is known for being the inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing. RSA is in widespread use in security applications, including digital signatures.Adleman attended the University of California, Berkeley, where he received his Bachelor's degree in 1968 and his Ph.D. in 1976.
In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system. In it, he solved a seven-node instance of the Hamiltonian Graph problem, an NP-Complete problem similar to the traveling salesman problem. While the solution to a seven-node instance is trivial, this paper is the first known instance of the successful use of DNA to compute an algorithm. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.
CLICK en LECTURE ONLY.