基于DNA计算的布尔矩阵乘法的计算机仿真
Computer Simulation of DNA Computing-Based Boolean Matrix Multiplication
AI总结：
本文开发了Python程序仿真Nobuyuki等人提出的基于DNA的布尔矩阵乘法算法，复现DNA序列生成与杂交等关键步骤，为未来构建大型DNA计算模拟器奠定基础。
摘要：
DNA计算是一种利用DNA分子的并行处理和信息存储能力的非传统计算方法。它已成为一个极具前景的领域，在解决各种计算复杂问题方面具有潜在应用。本文受Obront（2021）为Adleman（1994）提出的求解哈密顿路径问题的DNA计算算法所做类似工作的启发，利用计算机仿真探讨了Nobuyuki等人（2006）提出的用于布尔矩阵乘法的DNA计算算法。我们开发了一个Python程序来模拟基于DNA的布尔矩阵乘法算法中涉及的逻辑运算。该仿真复现了算法的关键步骤，包括DNA序列生成和杂交，但不模仿DNA分子的物理行为。它旨在作为更大型、更全面的DNA计算模拟器的基础原型，未来可作为教育或研究工具。通过这项工作，我们旨在促进对基于DNA的计算范式及其与传统计算系统相比的潜在优势和权衡的理解，为这一新兴领域的未来研究和发展铺平道路。
英文摘要：
DNA computing is an unconventional approach to computing that harnesses the parallelism and information storage capabilities of DNA molecules. It has emerged as a promising field with potential applications in solving a variety of computationally complex problems. This paper explores a DNA computing algorithm for Boolean matrix multiplication proposed by Nobuyuki et al. (2006) using a computer simulation, inspired by similar work done in the past by Obront (2021) for the DNA computing algorithm developed by Adleman (1994) for solving the Hamiltonian path problem. We develop a Python program to simulate the logical operations involved in the DNA-based Boolean matrix multiplication algorithm. The simulation replicates the key steps of the algorithm, including DNA sequence generation and hybridization, without imitating the physical behaviour of the DNA molecules. It is intended to serve as a basic prototype for larger, more comprehensive DNA computing simulators that can be used as educational or research tools in the future. Through this work, we aim to contribute to the understanding of DNA-based computing paradigms and their potential advantages and trade-offs compared to conventional computing systems, paving the way for future research and advancements in this emerging field.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
