Sciweavers

621 search results - page 10 / 125
» DNA Computing
Sort
View
ACTA
2007
126views more  ACTA 2007»
15 years 5 months ago
The syntactic monoid of hairpin-free languages
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
Lila Kari, Kalpana Mahalingam, Gabriel Thierrin
DBSEC
2010
129views Database» more  DBSEC 2010»
15 years 6 months ago
Secure Outsourcing of DNA Searching via Finite Automata
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
Marina Blanton, Mehrdad Aliasgari
CEC
2005
IEEE
15 years 7 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
15 years 10 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
DNA
2006
Springer
15 years 9 months ago
Design and Simulation of Self-repairing DNA Lattices
Self-repair is essential to all living systems, providing the ability to remain functional in spite of gradual damage. In the context of self-assembly of self-repairing synthetic b...
Urmi Majumder, Sudheer Sahu, Thomas H. LaBean, Joh...