[PDF][PDF] Direct-Proportional Length-Based DNA Computing for Shortest Path Problem.
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that
draws together chemistry, molecular biology, computer science, and mathematics. From the …
draws together chemistry, molecular biology, computer science, and mathematics. From the …
Experimental analysis of gene assembly with TopDown one-step real-time gene synthesis
Herein we present a simple, cost-effective TopDown (TD) gene synthesis method that
eliminates the interference between the polymerase chain reactions (PCR) assembly and …
eliminates the interference between the polymerase chain reactions (PCR) assembly and …
DNA recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial
generation of libraries. In this paper a new method is proposed for generating a initial pool, it …
generation of libraries. In this paper a new method is proposed for generating a initial pool, it …
On computational properties of template-guided DNA recombination
M Daley, I McQuillan - International Workshop on DNA-Based Computers, 2005 - Springer
The stichotrichous ciliates have attracted the attention of both biologists and computer
scientists due to the unique genetic mechanism of gene descrambling. It has been …
scientists due to the unique genetic mechanism of gene descrambling. It has been …
Parallel bioinspired algorithms for NP complete graph problems
IM Martínez-Pérez, KH Zimmermann - Journal of parallel and distributed …, 2009 - Elsevier
It is no longer believed that DNA computing will outperform digital computers when it comes
to the computation of intractable problems. In this paper, we emphasise the in silico …
to the computation of intractable problems. In this paper, we emphasise the in silico …
Hybridization-ligation versus parallel overlap assembly: An experimental comparison of initial pool generation for direct-proportional length-based DNA computing
Previously, direct-proportional length-based DNA computing (DPLB-DNAC) for solving
weighted graph problems has been reported. The proposed DPLB-DNAC has been …
weighted graph problems has been reported. The proposed DPLB-DNAC has been …
DNA computing for complex scheduling problem
MS Muhammad, Z Ibrahim, S Ueda, O Ono… - Advances in Natural …, 2005 - Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully
demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results …
demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results …
DNA implementation of k-shortest paths computation
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 …
realized by biochemical experiments in such a way that every path is encoded by …
[PDF][PDF] Application of Length-Based DNA Computing for an Elevator Scheduling Problem
MS Muhammad, Z Ibrahim, O Ono, M Khalid - International Journal of …, 2006 - intjit.org
This paper discussed the implementation ideas and experimental procedures to solve an
engineering related combinatorial problem using DNA computing approach. An elevator …
engineering related combinatorial problem using DNA computing approach. An elevator …