1793 search results - page 48 / 359 » On the Design of Codes for DNA Computing |
CASES
2006
ACM
15 years 5 months ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
PEPM
2009
ACM
15 years 8 months ago
2009
ACM
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
102
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
103
click to vote
PPAM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In order to take full advantage of high-end computing platforms, scientific applications often require modifications to source codes, and to their build systems that ge...