1057 search results - page 11 / 212 » Theoretical and Experimental DNA Computation |
FOCS
1995
IEEE
13 years 10 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
SOFTCO
2004
Springer
14 years 2 days ago
2004
Springer
The computational identification of genes in DNA sequences has become an issue of crucial importance due to the large number of DNA molecules being currently sequenced. We present ...
PLDI
2006
ACM
14 years 20 days ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
DNA
2003
Springer
13 years 12 months ago
2003
Springer
Affinity separation with magnetic beads is an important and widely used technique for DNA computing. We have designed and implemented an experimental lab-on-a-chip module for affin...
PAMI
1998
13 years 6 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...