Results 21 to 30 of about 333,155 (283)
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
DNA multi-bit non-volatile memory and bit-shifting operations using addressable electrode arrays and electric field-induced hybridization. [PDF]
, 2018 DNA has been employed to either store digital information or to perform parallel molecular computing. Relatively unexplored is the ability to combine DNA-based memory and logical operations in a single platform.
Heller, Michael J +3 more
core +3 more sources
A Generalized Theory of DNA Looping and Cyclization [PDF]
, 2009 We have developed a generalized semi-analytic approach for efficiently computing cyclization and looping $J$ factors of DNA under arbitrary binding constraints. Many biological systems involving DNA-protein interactions impose precise boundary conditions
Meiners, Jens-Christian +2 more
core +2 more sources
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
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
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 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
Computational Strategies for Scalable Genomics Analysis. [PDF]
, 2019 The revolution in next-generation DNA sequencing technologies is leading to explosive data growth in genomics, posing a significant challenge to the computing infrastructure and software algorithms for genomics analysis.
Shi, Lizhen, Wang, Zhong
core +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