59 search results - page 6 / 12 » dna 2000 |
IPPS
2000
IEEE
14 years 2 months 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 ...
DNA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract Self-assembly is a ubiquitous process in which small objects selforganize into larger and complex structures. In 2000, Rothemund and Winfree proposed a Tile Assembly Model...
EJC
2008
13 years 10 months ago
2008
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
ISMB
2000
13 years 11 months ago
2000
Understanding the mechanismsthat determine the regulation of geneexpression is an important and challenging problem. A fundamental subproblem is to identify DNA-bindingsites for u...
RECOMB
2000
Springer
14 years 1 months ago
2000
Springer
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...