Design of Hopfield Neural Network Based on DNA Strand Displacement Circuits and Its Application in Sudoku Conjecture

In recent years, biological neural networks have developed rapidly due to their advantages of fast parallel computing processing speed and strong fault tolerance. This article is dedicated to explore innovation in this field and successfully constructing a Hopfield neural network model based on DNA strand displacement (DSD) circuits. First, this article constructs four core functional modules based on DSD, including an encoder module, weighted sum module, comparator module, and decoder module. These functional modules together form the design foundation of the DSD circuit, achieving effective circuit construction. Second, the construction of the Hopfield neural network is achieved through DSD circuits. The construction of this network achieves the integration of DSD technology and neural networks. Finally, the Sudoku conjecture problem is solved through the neural network. This article conducts a simulation in visual DSD, which verifies the feasibility of Sudoku conjecture. Our work integrates DSD technology with neural networks and uses them to solve practical problems. This fusion broadens the research field of neural networks and demonstrates the potential of biotechnology in practical applications.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Neural Networks and Learning Systems
Published
2025-06-19
DOI
https://doi.org/10.1109/tnnls.2025.3576888
Citations
2
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
1.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of Hopfield Neural Network Based on DNA Strand Displacement Circuits and Its Application in Sudoku Conjecture

Junwei Sun, Dan Ling, Yi Yue, Haojie Wang et al.
2 citations
IEEE Transactions on Neural Networks and Learning Systems
graph theory and CDMA systems
1.46
article

Design of Hopfield Neural Network Based on DNA Strand Displacement Circuits and Its Application in Sudoku Conjecture

Junwei Sun, Dan Ling, Yi Yue, Haojie Wang, Yanfeng Wang
article en
2 citations

Abstract

In recent years, biological neural networks have developed rapidly due to their advantages of fast parallel computing processing speed and strong fault tolerance. This article is dedicated to explore innovation in this field and successfully constructing a Hopfield neural network model based on DNA strand displacement (DSD) circuits. First, this article constructs four core functional modules based on DSD, including an encoder module, weighted sum module, comparator module, and decoder module. These functional modules together form the design foundation of the DSD circuit, achieving effective circuit construction. Second, the construction of the Hopfield neural network is achieved through DSD circuits. The construction of this network achieves the integration of DSD technology and neural networks. Finally, the Sudoku conjecture problem is solved through the neural network. This article conducts a simulation in visual DSD, which verifies the feasibility of Sudoku conjecture. Our work integrates DSD technology with neural networks and uses them to solve practical problems. This fusion broadens the research field of neural networks and demonstrates the potential of biotechnology in practical applications.

IEEE Transactions on Neural Networks and Learning SystemsVol. 36(10)
Zhengzhou University of Light Industry (CN)
National Natural Science Foundation of China, Natural Science Foundation of Henan Province
Openalex Percentile: Top 17%
graph theory and CDMA systems
1.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.