Pharma Investments, Ventures & Law Weekly
Welcome to NewsRx!
Learn more about a six-week, no-risk free trial of Pharma Investments, Ventures & Law Weekly
We're a pay-per-view site for premium content. If you'd like to purchase this article, it's only $3.00.
Algorithms
New algorithms study findings have been reported by researchers at Ocean University of China, Department of Biotechnology
March 16th, 2008
Scientists discuss in 'Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction' new findings in algorithms. "A new DNA computing algorithm based on a ligase chain reaction is demonstrated to solve an SAT problem. The proposed DNA algorithm can solve an n-variable m-clause SAT problem in m steps and the computation time required is O (3m+n)," scientists in Qingdao, People's Republic of China report. "Instead of generating the full-solution DNA library, we start with an empty test tube and then generate solutions that partially satisfy the SAT formula. These partial solutions are then extended step by step by the ligation of new variables...
Source: Pharma Investments, Ventures & Law Weekly (2008-03-16)
|
