Sciweavers

47 search results - page 2 / 10
» Strand Algebras for DNA Computing
Sort
View
FCS
2006
13 years 6 months ago
A Procedure for Max-SAT with DNA Strands
Abstract: In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has had considerable attention as one of non-silicon based computi...
Yuichiro Tokumaru, Akihiro Fujiwara
DNA
2004
Springer
126views Bioinformatics» more  DNA 2004»
13 years 11 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, ...
DNA
2009
Springer
158views Bioinformatics» more  DNA 2009»
14 years 22 hour ago
Design of a Biomolecular Device That Executes Process Algebra
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
Urmi Majumder, John H. Reif
CSIE
2009
IEEE
14 years 6 days ago
Identifying DNA Strands Using a Kernel of Classified Sequences
— Automated DNA sequencing produces a large amount of raw DNA sequence data that then needs to be classified, organized, and annotation. One major application is the comparison o...
Guillermo Tonsmann, David D. Pollock, Wanjun Gu, T...
IPPS
2003
IEEE
13 years 10 months ago
Addressable Procedures for Logic and Arithmetic Operations with DNA Strands
In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA represent...
Akihiro Fujiwara, Ken-ichi Matsumoto, Wei Chen