请登录

记住密码
注册

请登录

记住密码
注册

操作失败

duang出错啦~~

非常抱歉,

你要访问的页面不存在,

操作失败

Sorry~~

非常抱歉,

你要访问的页面不存在,

提示

duang~~

非常抱歉,

你要访问的页面不存在,

提示

验证码:

Leonard Adleman

职称:Professor of Molecular Biology

所属学校:University of Southern California

所属院系:Computer Science

所属专业:Computer Science

联系方式:(213) 740-6490

简介

1976, Phd, Computer Science, UC - Berkeley 1968, Bachelors, Other Mathematics, UC - Berkeley

职业经历

Adleman was born in California. He grew up in San Francisco and attended the University of California, Berkeley, where he received his BA degree in mathematics in 1968 and his Ph.D. degree in EECS 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 travelling 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. He coined the neologism "computer virus". In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation. Specifically, they solved a 20-variable SAT problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem. For his contribution to the invention of the RSA cryptosystem, Adleman, along with Ron Rivest and Adi Shamir, has been a recipient of the 1996 Paris Kanellakis Theory and Practice Award and the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science. Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006. He is one of the original discoverers of the Adleman–Pomerance–Rumely primality test. Fred Cohen, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus". He was also the mathematical consultant on the movie Sneakers. Adleman is also an amateur boxer and has sparred with James Toney. He is also widely referred to as the Father of DNA Computing. He is a member of the National Academy of Engineering and the National Academy of Sciences. Currently, Adleman is working on the mathematical theory of Strata.

该专业其他教授