Strand Algebras for DNA Computing

13 years 11 months ago

Download lucacardelli.name

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

Real-time Traffic

Computational Biology | DNA 2009 | DNA Computing | Formal Systems | Process Algebra |

claim paper

Related Content

» Recognizing DNA Splicing

» Procedures for Computing the Maximum with DNA Strands

» TwoDomain DNA Strand Displacement

» The syntactic monoid of hairpinfree languages

» A Procedure for MaxSAT with DNA Strands

» DNA Extraction by XPCR

» Design of a Biomolecular Device That Executes Process Algebra

» Identifying DNA Strands Using a Kernel of Classified Sequences

» Addressable Procedures for Logic and Arithmetic Operations with DNA Strands

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	DNA
Authors	Luca Cardelli

Comments (0)

Sciweavers

Strand Algebras for DNA Computing

Computational Biology | DNA 2009 | DNA Computing | Formal Systems | Process Algebra |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers