Sciweavers

621 search results - page 3 / 125
» DNA Computing
Sort
View
DNA
2004
Springer
126views Bioinformatics» more  DNA 2004»
14 years 1 months ago
DNA Extraction by XPCR
The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is pr...
Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, ...
DAM
2006
106views more  DAM 2006»
13 years 7 months ago
Computational complexity of isothermic DNA sequencing by hybridization
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Jacek Blazewicz, Marta Kasprzak
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 1 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
DNA
2001
Springer
164views Bioinformatics» more  DNA 2001»
14 years 3 days ago
A Clause String DNA Algorithm for SAT
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...
Vincenzo Manca, Claudio Zandron
TCS
2002
13 years 7 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...