DNA Computing

Description

Computing by representing information in the form of DNA base sequences has several potential advantages over silicon-based computing methods, due to the massive parallelism of the biochemical reactions on DNA molecules. These advantages include, enhanced processing speeds, reduced energy consumption and greater storage capacity. DNA computing can solve problems intractable by conventional methods including but not limited to, organization of massive evacuations, organization of response to invasion, supply chain problems, and computer chip assembly problems. As a result, there is tremendous interest in utilizing the computing capacity of DNA. One of the major hurdles that must be overcome in order for DNA computing to become a tangible reality is the nondeterministic polynomial (NP) optimization problem, a class of optimization for which no efficient algorithm has been developed. Thus improved DNA-based computing methods for solving NP optimization problems are needed in the art.

In response to this need, researchers at Arizona State University have developed a novel approach to using DNA-based computing methods to solve the NP optimization problem by exploiting the hybridization properties of oligonucleotides.

Potential Applications

•         Computing Industry

•         Information Technology Industry

Benefits and Advantages

Overcoming the NP optimization problem allowing for the use of DNA computing has the following advantages

•         Enhanced processing speeds

•         Reduced energy consumption

•         Greater storage capacity

 

For more information about the inventor(s) and their research, please see
Dr. Frasch's departmental webpage

Case ID:
M06-028L
Published:
10-18-2010
Last Updated:
05-16-2018

Patent Information

App Type:
Nationalized PCT
Serial No.:
12/181,056
Patent No.:
8,126,649
File Date:
01-29-2007
Issue Date:
02-28-2012
Expire Date:
01-25-2028

For More Information, Contact