Sciweavers

47 search results - page 1 / 10
» Strand Algebras for DNA Computing
Sort
View
DNA
2009
Springer
120views Bioinformatics» more  DNA 2009»
13 years 11 months ago
Strand Algebras for DNA Computing
We present a process algebra for DNA computing, discussing compilation of other formal systems into the algebra, and compilation of the algebra into DNA structures.
Luca Cardelli
DNA
2005
Springer
128views Bioinformatics» more  DNA 2005»
13 years 10 months ago
Recognizing DNA Splicing
Abstract. Motivated by recent techniques developed for observing evolutionary dynamics of a single DNA molecule, we introduce a formal model for accepting an observed behavior of a...
Matteo Cavaliere, Natasa Jonoska, Peter Leupold
PDPTA
2003
13 years 6 months ago
Procedures for Computing the Maximum with DNA Strands
Abstract: In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of nonsilicon based computings. ...
Satoshi Kamio, Akiko Takehara, Akihiro Fujiwara
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
Two-Domain DNA Strand Displacement
We investigate the computing power of a restricted class of DNA strand displacement structures: those that are made of double strands with nicks (interruptions) in the top strand....
Luca Cardelli
ACTA
2007
126views more  ACTA 2007»
13 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