Sciweavers

TCS
2002
13 years 4 months ago
Topics in the theory of DNA computing
DNA computing, or, more generally, molecular computing, is an exciting fast developing interdisciplinary area. Research in this area concerns theory, experiments, and applications...
Martyn Amos, Gheorghe Paun, Grzegorz Rozenberg, Ar...
IPPS
2000
IEEE
13 years 9 months ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu
ICNC
2005
Springer
13 years 10 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
DNA
2009
Springer
120views Bioinformatics» more  DNA 2009»
13 years 11 months ago
Strand Algebras for DNA Computing
We present a process algebra for DNA computing, discussing compilation of other formal systems into the algebra, and compilation of the algebra into DNA structures.
Luca Cardelli