.png){kind=icon}
.png){kind=icon}
Return
DNA Computing: DNA circuits and data storage
.png){kind=icon}
PRE
AI
DOI：10.1039/D5NH00459D.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Computation has consistently served as a significant indicator and direction of social development; and the volume; speed; and accuracy are the critical factors during the development. To accelerate this computational process; people have developed various advanced technologies and constantly optimized computational methods; such as upgrading chip design and proposing quantum and photonic computing. Recently; DNA computing; as a unique computational model distinct from traditional methods; offers remarkable advantages and addresses problems that are difficult to solve with conventional computing. By designing DNA molecules and utilizing their spontaneous reactions; specific types of complex problems can be solved; such as combinatorial optimization; traveling salesman; Sudoku and other Nondeterministic Polynomial time (NP) problems. This type of computation; based on the spontaneity of reactions; exhibits high parallelism; making DNA computing a viable solution for high-complexity problems. This review presents an overview of the theoretical foundations of DNA computing and summarizes three distinct advantages compared to traditional computing: high parallelism; efficient storage; and low energy consumption. Furthermore; based on these advantages; we assess the current state of development in two critical branches of DNA computing: DNA circuit and DNA information storage; and provide our unique insights for future development of DNA computing.
Keywords:
DNA computing
parallelism
information storage
quantum computing
computational efficiency
Journal
IF:
6.6
Papers:
1.3K
Citations:
6.3K
Organization
No organization information available