Results 21 to 30 of about 122,806 (254)
Stable DNA Sequence Over Close-Ending and Pairing Sequences Constraint
Frontiers in Genetics, 2021 DNA computing is a new method based on molecular biotechnology to solve complex problems. The design of DNA sequences is a multi-objective optimization problem in DNA computing, whose objective is to obtain optimized sequences that satisfy multiple ...
Xue Li, Ziqi Wei, Bin Wang, Tao Song
doaj +1 more source
Information and Computation, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diana Rooß, Klaus W. Wagner
openaire +2 more sources
A DNA computing inspired computational model
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FRANCO, Giuditta, M. Margenstern
openaire +2 more sources
DNA computing for combinational logic [PDF]
Science China Information Sciences, 2018 With the progressive scale-down of semiconductor's feature size, people are looking forward to More Moore and More than Moore. In order to offer a possible alternative implementation process, people are trying to figure out a feasible transfer from silicon to molecular computing.
Chuan Zhang 0001 +6 more
openaire +2 more sources
A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.
PLoS ONE, 2020 A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm.
Xiang Tian +4 more
doaj +1 more source
On the computational power of DNA
Discrete Applied Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Boneh +3 more
openaire +2 more sources
A BPSON Algorithm Applied to DNA Codes Design
IEEE Access, 2019 DNA computing proposed by Adelman is new biotechnology which provides a new way to solve NP-hard problem. It has a promising future and successful results of various applications. DNA codes design is a significant step in DNA computing.
Kaiqiang Liu +4 more
doaj +1 more source
DNA Design Based on Improved Ant Colony Optimization Algorithm With Bloch Sphere
IEEE Access, 2021 DNA computing and coding have good application prospects in data storage, data computing, data encryption and other fields. Meanwhile, it is very important to design a set of DNA coding set that meets a variety of constraints in today’s research ...
Qihang Zhou, Xiao Wang, Changjun Zhou
doaj +1 more source
Error-resilient DNA computation [PDF]
Random Structures and Algorithms, 1999 Summary: The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives: Extract-a-bit, which splits a test tube into two test tubes according to the value of a particular bit \(x\), merge-two-tubes, and detect-emptiness. If perfect, these operations can test the satisfiability of any Boolean formula
Karp, Richard M. +2 more
openaire +4 more sources
DNA Computing in Microreactors [PDF]
, 2002 The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial optimisation problems, such as Maximum Clique or 3-SAT. This work demonstrates by construction how one micro-reactor design can be programmed optically to solve any instance of Maximum
Danny van Noort +2 more
openaire +1 more source