Yusei Tsuboi

Learn More
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From the DNA computing point of view, it has been proven that it is possible to solve weighted graph problems by exploiting some characteristics of DNA such as length, concentration, and(More)
DNA computing has a lot of potential, in terms of ability to implement a relational database with circular molecules. In this work, a new DNA-based semantic model is proposed and described theoretically for implementing DNA based memories. This model, referred to as ‘semantic model based on molecular computing’ (SMC), has the structure of a graph formed by(More)
A new readout approach for the Hamiltonian Path Problem (HPP) in DNA computing based on the real-time polymerase chain reaction (PCR) is investigated. Several types of fluorescent probes and detection mechanisms are currently employed in real-time PCR, including SYBR Green, molecular beacons, and hybridization probes. In this study, real-time amplification(More)
Previously, direct-proportional length-based DNA computing (DPLB-DNAC) for solving weighted graph problems has been reported. The proposed DPLB-DNAC has been successfully applied to solve the shortest path problem, which is an instance of weighted graph problems. The design and development of DPLB-DNAC is important in order to extend the capability of DNA(More)
Bio-molecular or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, engineering, and mathematics. From DNA computing point of view, it has been proven that it is possible to solve weighted graph problems such as Traveling Salesman Problem (TSP) and the shortest path problem by(More)
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is employed for efficient(More)
In this paper, an in vitro implementation of DNA computing for solving k-shortest paths problem of a weighted graph is reported. The encoding is designed in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides. For initial pool generation, parallel overlap assembly is(More)
Semantic Net is among the problem solving systems in artificial intelligence fields. In this paper, we demonstrate how to design DNA-typed Semantic Net in order to apply DNA computing to artificial intelligence. Moreover, we propose a problem-solving method with DNA-typed Semantic Net. In this method, it is possible to reason out a reference object by using(More)
DNA computing often makes use of hybridization, whether for vastly generating the initial candidate answers or amplification by using polymerase chain reaction (PCR). The main idea behind DNA computing approaches for solving weighted graph problems is that if the degree of hybridization can be controlled, then it is able to generate more double stranded(More)