621 search results - page 7 / 125 » DNA Computing |
IPPS
2000
IEEE
14 years 19 hour ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
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...
ISMB
1998
13 years 9 months ago
1998
We study from a computational standpoint several different physicalscales associatedwith structural features of DNA sequences, including dinucleotide scales such as base stacking ...
BMCBI
2008
13 years 7 months ago
2008
Background: DNA methylation patterns have been shown to significantly correlate with different tissue types and disease states. High-throughput methylation arrays enable large-sca...